New descent rules for solving the linear semi-infinite programming problem

DOI10.1016/0167-6377(94)90006-XzbMath0810.90123OpenAlexW2143082120MaRDI QIDQ1332958

Enriqueta Vercher, Teresa Leon

Publication date: 5 September 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90006-x

zbMATH Keywords

continuous semi-infinite linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (7)

Solving a class of fuzzy linear programs by using semi-infinite programming techniques ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ Analytical linear inequality systems and optimization ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Logarithmic Barrier Decomposition Methods for Semi-infinite Programming ⋮ On linear inequality systems with smooth coefficients ⋮ A multi-local optimization algorithm

Uses Software

• XMP

Cites Work

• A comparative study of several semi-infinite nonlinear programming algorithms
• A purification algorithm for semi-infinite programming
• An extension of the simplex algorithm for semi-infinite linear programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• A projected lagrangian algorithm for semi-infinite programming
• An optimality test for semi-infinite linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New descent rules for solving the linear semi-infinite programming problem