Primal and dual optimality criteria in convex programming

DOI10.1007/BF01965717zbMath0417.90070MaRDI QIDQ3208441

A. Charnes, Aharon Ben-Tal

Publication date: 1977

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

convex programmingnecessary and sufficient conditionsparametric linear programconvex differentiable functionconvex differential constraintsdual characterization theoremsdual optimality criteriaprimal optimality criteria

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of optimality in convex programming without a constraint qualification
• Ordinary convex programs without a duality gap
• A theorem of the alternative with application to convex programming: optimality, duality, and stability
• Duality and asymptotic solvability over cones

This page was built for publication: Primal and dual optimality criteria in convex programming