Generalized corner optimal solution for LSIP: existence and numerical computation

DOI10.1007/s11750-015-0374-zzbMath1336.90093OpenAlexW2026295250MaRDI QIDQ286184

Yanqun Liu

Publication date: 20 May 2016

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-015-0374-z

zbMATH Keywords

algorithmconvergencelinear semi-infinite programminggeneralized ladder point optimal solution

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (1)

Recent contributions to linear semi-infinite optimization: an update

Cites Work

• Unnamed Item
• Unnamed Item
• A ladder method for linear semi-infinite programming
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• An exterior point linear programming method based on inclusive normal cones
• Duality in linear programming: from trichotomy to quadrichotomy
• Geometric fundamentals of the simplex method in semi-infinite programming
• An extension of the simplex algorithm for semi-infinite linear programming
• Simplex-Like Trajectories on Quasi-Polyhedral Sets
• A bridging method for global optimization

This page was built for publication: Generalized corner optimal solution for LSIP: existence and numerical computation