Lexocographic multipliers
From MaRDI portal
Publication:1146112
DOI10.1016/0022-247X(80)90228-0zbMath0446.90067OpenAlexW4205916508MaRDI QIDQ1146112
Publication date: 1980
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(80)90228-0
lexicographic ordersubgradientsconvex functionalsmulticriteria programmingdifferentiable programmingdual characterization of optimalityno constraint qualificationpolynomial Lagrange multipliers
Related Items
On constraint sets of infinite linear programs over ordered fields ⋮ Characterizations of efficient solutions under polyhedrality assumptions ⋮ Semi-infinite programming duality for order restricted statistical inference models ⋮ Strong duality for standard convex programs
Cites Work
- On equating the difference between optimal and marginal values of general convex programs
- An extension of a theorem of Jeroslow and Kortanek
- Proper efficiency and the theory of vector maximization
- On semi-infinite systems of linear inequalities
- An approach to nonlinear programming
- Sur la fonction d'appui des ensembles convexes dans un espace localement convexe
- The geometry of Pareto efficiency over cones
- A unified theory of first and second order conditions for extremum problems in topological vector spaces
- Geometric Programming
- Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
- Proper Efficient Points for Maximizations with Respect to Cones
- Weak Tangent Cones and Optimization in a Banach Space
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
