Strong duality for inexact linear programming

DOI10.1080/02331930108844532zbMath1168.90557OpenAlexW2023927345MaRDI QIDQ2720275

Juan Alfredo Gómez, Jorge Amaya

Publication date: 26 June 2001

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Dubovitskii - Milyutin ApproachInexact linear ProgrammingParametrized DataStrong Duality

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (6)

Semi-infinite programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ Primal-dual stability in continuous linear optimization ⋮ Duality for inexact semi-infinite linear programming ⋮ Cutting plane algorithms for robust conic convex optimization problems ⋮ Linear semi-infinite programming theory: an updated survey

Cites Work

• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• Duality for inexact linear programming problems^∗
• Semi-Infinite Programming: Theory, Methods, and Applications
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Constraint Qualifications for Inexact Linear Programs
• Some generalization of inexact linear programming
• Strong Duality for Semidefinite Programming
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Convex Analysis
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Strong duality for inexact linear programming