Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

DOI10.1080/01630563.2019.1566244zbMath1411.90212OpenAlexW2922475173MaRDI QIDQ4631912

Tran Hong Mo, Trinh T. T. Tran, Pham Duy Khanh

Publication date: 23 April 2019

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

dualitysolvabilityseparation theoremclosednessdual paircomplementary slacknessinfinite dimensional linear programing

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Programming in abstract spaces (90C48)

Related Items (2)

Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space ⋮ On the duality gap and Gale's example in infinite-dimensional conic linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic duality theorems for infinite LP problems
• A review of duality theory for linear programming over topological vector spaces
• Subdifferentiability and the duality gap
• On Zero Duality Gap and the Farkas Lemma for Conic Programming
• Linear Inequalities and Related Systems. (AM-38)
• Programmes in Paired Spaces
• Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm
• An Infinite-Dimensional LP Duality Theorem
• Semi-infinite programming. Recent advances
• Duality gap function in infinite dimensional linear programming

This page was built for publication: Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems