Generalized corner optimal solution for LSIP: existence and numerical computation

DOI10.1007/S11750-015-0374-ZMaRDI QIDQ286184zbMATH OpenOpenAlexFDO

Authors 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

convergencealgorithmgeneralized ladder point optimal solutionlinear semi-infinite programming

Mathematics Subject Classification ID

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

Recommendations

• A ladder method for linear semi-infinite programming
• Generalized semi-infinite programming: numerical aspects
• Generalized semi-infinite programming: Theory and methods
• On Linear Semi-Infinite Programming Problems: An Algorithm
• Generalized semi-infinite programming: a tutorial

Cites work

• scientific article; zbMATH DE number 1186924 (Why is no real title available?)
• A bridging method for global optimization
• A ladder method for linear semi-infinite programming
• An extension of the simplex algorithm for semi-infinite linear programming
• 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
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Linear semi-infinite optimization: recent advances
• Simplex-like trajectories on quasi-polyhedral sets.

Cited in

(1)

• Recent contributions to linear semi-infinite optimization: an update

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

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