Title
The boundedness of the Lagrange multipliers set and duality in mathematical programming
Abstract
We are interested in this paper to determine the properties which are, in the primal, related to the boundedness properties of the set of the Lagrange multipliers. In convex programming it is shown that it is more or less equivalent to the generealized Slater condition. From there, we generalize to Banach spaces all the results on this topic which were known for finite dimensional spaces in differentiable and locally Lipschitz programming.
Year
DOI
Venue
1981
10.1007/BF01917172
Zeitschr. für OR
Keywords
Field
DocType
mathematical programming,convex programming,banach space,lagrange multiplier
Mathematical optimization,Lagrange multiplier,Slater's condition,Constraint algorithm,Duality (optimization),Lipschitz continuity,Quadratic programming,Karush–Kuhn–Tucker conditions,Convex optimization,Mathematics
Journal
Volume
Issue
ISSN
25
7
1432-5217
Citations 
PageRank 
References 
3
0.47
4
Authors
1
Name
Order
Citations
PageRank
J.-CH. Pomerol1222.64