Primal and dual optimality criteria in convex programming

DOI10.1007/BF01965717MaRDI QIDQ3208441zbMATHFDO

Authors Aharon Ben-Tal, A. Charnes

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

• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• A theorem of the alternative with application to convex programming: optimality, duality, and stability
• Characterization of optimality in convex programming without a constraint qualification
• Duality and asymptotic solvability over cones
• Ordinary convex programs without a duality gap

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

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