An optimality test for semi-infinite linear programming

DOI10.1080/02331939208843842zbMath0814.49027OpenAlexW1967864107MaRDI QIDQ4327961

Enriqueta Vercher, Teresa Leon

Publication date: 11 June 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionconstraint qualificationsemi-infinite linear programmingcondition of Kuhn-Tucker type

Mathematics Subject Classification ID

Semi-infinite programming (90C34) Optimality conditions (49K99)

Related Items (3)

New descent rules for solving the linear semi-infinite programming problem ⋮ Analytical linear inequality systems and optimization ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Farkas-Minkowski systems in semi-infinite programming
• A purification algorithm for semi-infinite programming
• On the existence and nonexistence of Lagrange multipliers in Banach spaces
• A remark on a regularity assumption for the mathematical programming problem in Banach spaces
• An extension of the simplex algorithm for semi-infinite linear programming
• Optimality conditions for nondifferentiable convex semi-infinite programming
• On constraint sets of infinite linear programs over ordered fields
• Optimality conditions for convex semi-infinite programming problems

This page was built for publication: An optimality test for semi-infinite linear programming