Duality for inexact semi-infinite linear programming

DOI10.1080/02331930412331286595MaRDI QIDQ5466702zbMATH OpenOpenAlexFDO

Authors Juan A. Gómez, Paul Bosch, 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

dualityDubovitskii-Milyutin approachsemi-infinite linear programming

Mathematics Subject Classification ID

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

Recommendations

• Duality for inexact linear programming problems^∗
• scientific article; zbMATH DE number 4114367
• Duality for semi-definite and semi-infinite programming
• Duality for nonsmooth semi-infinite programming problems
• Duality in infinite dimensional linear programming
• On duality in semi-infinite programming and existence theorems for linear inequalities
• Duality for Semi-Definite and Semi-Infinite Programming with Equality Constraints
• scientific article; zbMATH DE number 3986031
• On duality theory of convex semi-infinite programming
• Perfect duality in semi-infinite and semidefinite programming

Cites work

• Connections between generalized, inexact and semi-infinite linear programming
• Continuous selections. I
• Direct theorems in semi-infinite convex programming
• Duality for inexact linear programming problems^∗
• Functional Analysis
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• Integrals which are convex functionals. II
• Robust convex optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• Semidefinite Programming
• Some generalization of inexact linear programming
• Strong duality for inexact linear programming
• Strong Duality for Semidefinite 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

Cited in

(14)

• On duality in semi-infinite programming and existence theorems for linear inequalities
• ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty
• A note on primal-dual stability in infinite linear programming
• The set of target vectors in a semi-infinite linear program with a duality gap
• Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
• Cutting plane algorithms for robust conic convex optimization problems
• On duality theory of convex semi-infinite programming
• scientific article; zbMATH DE number 3970516 (Why is no real title available?)
• scientific article; zbMATH DE number 3986031 (Why is no real title available?)
• Duality for semi-definite and semi-infinite programming
• Strong duality and sensitivity analysis in semi-infinite linear programming
• scientific article; zbMATH DE number 5036103 (Why is no real title available?)
• Perfect duality in semi-infinite and semidefinite programming
• On generalized semi-infinite programming. (With comments and rejoinder).

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

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