On A characterization of optimality in convex programming

DOI10.1007/BF01580372zbMath0352.90048OpenAlexW1971344796MaRDI QIDQ4123086

Aharon Ben-Tal, Adi Ben-Israel

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580372

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

On optimality in abstract convex programming, A strengthened test for optimality, A simplified test for optimality, Calculating the cone of directions of constancy, Relación entre conos de direcciones decrecientes y conos de direcciones de descenso, Complete characterization of optimality for convex programming in banach spaces^†, Finite dimensional second order optimality conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of optimality in convex programming without a constraint qualification
• Ordinary convex programs without a duality gap
• Seven Kinds of Convexity