Lexocographic multipliers

DOI10.1016/0022-247X(80)90228-0MaRDI QIDQ1146112zbMATH OpenOpenAlexFDO

Authors Jonathan M. Borwein

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

zbMATH Keywords

convex functionalsdifferentiable programmingdual characterization of optimalitylexicographic ordermulticriteria programmingno constraint qualificationpolynomial Lagrange multiplierssubgradients

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Cites work

• A unified theory of first and second order conditions for extremum problems in topological vector spaces
• An approach to nonlinear programming
• An extension of a theorem of Jeroslow and Kortanek
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Geometric Programming
• scientific article; zbMATH DE number 3271001 (Why is no real title available?)
• scientific article; zbMATH DE number 3271295 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3320765 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3336546 (Why is no real title available?)
• Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
• On equating the difference between optimal and marginal values of general convex programs
• On semi-infinite systems of linear inequalities
• Proper efficiency and the theory of vector maximization
• Proper Efficient Points for Maximizations with Respect to Cones
• Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
• Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
• Sur la fonction d'appui des ensembles convexes dans un espace localement convexe
• The geometry of Pareto efficiency over cones
• Weak Tangent Cones and Optimization in a Banach Space

Cited in

(5)

• Strong duality for standard convex programs
• On constraint sets of infinite linear programs over ordered fields
• Semi-infinite programming duality for order restricted statistical inference models
• Characterizations of efficient solutions under polyhedrality assumptions
• Linear copositive programming: strong dual formulations and their properties

This page was built for publication: Lexocographic multipliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146112)