Duality for inexact linear programming problems∗

DOI10.1080/02331939708844278zbMath0872.90057OpenAlexW2003667322MaRDI QIDQ3123134

Jorge Amaya, Guy de Ghellinck

Publication date: 6 March 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844278

zbMATH Keywords

inexact linear programming

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Related Items (4)

Strong duality for inexact linear programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ Duality for inexact semi-infinite linear programming ⋮ Cutting plane algorithms for robust conic convex optimization problems

Cites Work

• Stability of the optimal basis of a linear program under uncertainty
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Constraint Qualifications for Inexact Linear Programs
• Some generalization of inexact linear programming
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Duality for inexact linear programming problems^∗