Duality for inexact semi-infinite linear programming

DOI10.1080/02331930412331286595zbMath1087.90048OpenAlexW2080162959MaRDI QIDQ5466702

Paul Bosch, Juan Alfredo Gómez, Jorge Amaya

Publication date: 25 August 2005

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/176795

zbMATH Keywords

dualitysemi-infinite linear programmingDubovitskii-Milyutin approach

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Semi-infinite programming (90C34)

Related Items (4)

On generalized semi-infinite programming. (With comments and rejoinder). ⋮ ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ Cutting plane algorithms for robust conic convex optimization problems

Cites Work

• Unnamed Item
• Continuous selections. I
• Integrals which are convex functionals. II
• Strong duality for inexact linear programming
• Robust Convex Optimization
• Duality for inexact linear programming problems^∗
• Semi-Infinite Programming: Theory, Methods, and Applications
• Connections between generalized, inexact and semi-infinite linear programming
• Direct theorems in semi-infinite convex programming
• Some generalization of inexact linear programming
• Strong Duality for Semidefinite Programming
• Functional Analysis
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Semidefinite Programming
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Duality for inexact semi-infinite linear programming