The boundedness of the Lagrange multipliers set and duality in mathematical programming
DOI10.1007/BF01917172zbMath0473.90085OpenAlexW1984234991MaRDI QIDQ3929568
Publication date: 1981
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01917172
necessary optimality conditionsboundednessdualityconstraint qualificationsnondifferentiable programminglocally Lipschitz programmingdifferentiable programmingLagrange multiplier setgeneralized Slater qualification
Convex programming (90C25) Nonlinear programming (90C30) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) General theory of locally convex spaces (46A03) Optimality conditions for problems in abstract spaces (49K27)
Related Items (1)
Cites Work
- A regularity condition for optimization in Banach spaces: Counter examples
- Regularity and stability for the mathematical programming problem in Banach spaces
- Sufficient Conditions for Kuhn–Tucker Vectors in Convex Programming
- On conditions to have bounded multipliers in locally lipschitz programming
- Erratum: Sufficient Conditions for Kuhn-Tucker Vectors in Convex Programming
- Problème des inégalités. Applications à la programmation et au contrôle optimal
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Differential Stability in Nonlinear Programming
- On optimality conditions in nondifferentiable programming
- A New Approach to Lagrange Multipliers
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The boundedness of the Lagrange multipliers set and duality in mathematical programming
