Convex Programs and Their Closures.

Abstract

We extend the limiting lagrangean equation limit as theta approaches 0(+) sup over Lambda inf over x as elements of K < f0(x) + theta (wx + w1) + sum over has elements of H of lambda h fh(x) > = v(P), and the results on affine supports from which it was deduced, to a very general setting that subsumes the previous constraint qualifications. A simple example shows the need for some constraint qualification. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1978
Accession Number
ADA074718

Entities

People

  • C. E. Blair
  • J. Borwein
  • Robert G. Jeroslow

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Contracts
  • Convex Sets
  • Equations
  • Hypotheses
  • Illinois
  • New Jersey
  • New York
  • Nonlinear Programming
  • Optimization
  • Qualifications
  • Schools
  • Theorems
  • Universities

Fields of Study

  • Mathematics

Readers

  • Analytical Mechanics
  • Mathematical Modeling and Probability Theory.