A simplified test for optimality

DOI10.1007/BF00933262zbMath0352.90047OpenAlexW2086835013MaRDI QIDQ1236066

L. Kerzner, R. A. Abrams

Publication date: 1978

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (16)

Una caracterización dual de optimalidad para optimización convexa ⋮ A saddle-point characterization of Pareto optima ⋮ Input optimization: I. Optimal realizations of mathematical models ⋮ Partly convex programming and Zermelo's navigation problems ⋮ Characterizing optimality in mathematical programming models ⋮ Unnamed Item ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ Regularizing the abstract convex program ⋮ A strengthened test for optimality ⋮ Method of reduction in convex programming ⋮ Unnamed Item ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ Geometry of optimality conditions and constraint qualifications: The convex case ⋮ Complete characterization of optimality for convex programming in banach spaces^† ⋮ A mathematical formulation of time-cost and reliability optimization for supply chain management in research-development projects ⋮ Characterizing an optimal input in perturbed convex programming

Cites Work

• Characterization of optimality in convex programming without a constraint qualification
• Systems of Inequalities Involving Convex Functions
• On A characterization of optimality in convex programming
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming

This page was built for publication: A simplified test for optimality