Some generalization of inexact linear programming

DOI10.1080/02331939208843740zbMath0817.90065OpenAlexW1973553606MaRDI QIDQ4327872

Marian Matłoka

Publication date: 27 March 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

inexact programmingfeasible and optimal solution

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Duality for inexact linear programming problems^∗

Cites Work

• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Constraint Qualifications for Inexact Linear Programs
• 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
• Erratum

This page was built for publication: Some generalization of inexact linear programming