Abstract
In this paper, we consider general linear semi-infinite programming (LSIP) problems and study the existence and computation of optimal solutions at special generalized corner points called generalized ladder points (glp). We develop conditions, including an equivalent condition, under which glp optimal solutions exist. These results are fundamentally important to the ladder method for LSIP, which finds an optimal solution at a glp in the feasible region. For problems that do not have glp optimal solutions, we propose the addition of special artificial constraints to the constraint system of the problem to create a glp optimal solution. We present a ladder algorithm based on the maximum violation rule and an artificial ladder technique. Convergence results are provided with the support of some numerical tests.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson EJ, Goberna MA, Lopez MA (2001) Simplex-like trajectories on quasi-polyhedral convex sets. Math Oper Res 26:147–162
Anderson EJ, Lewis AS (1989) An extension of the simplex algorithm for semi-infinite linear programming. Math Program 44:247–269
Glashoff K, Gustafson SA (1983) Linear optimization and approximation. Springer, Berlin
Goberna MA (2005) Linear semi-infinite optimization: a guided tour. IMCA monographs, vol 40. IMCA, Lima
Goberna MA (2005) Linear semi-infinite, optimization: recent advances. In: Jeyakumar V, Rubinov AM (eds) Continuous optimization, current trends and modern applications. Applied optimization, vol 99. Springer, New York, pp 3–22
Goberna MA, Jornet V (1988) Geometric fundamentals of the simplex method in semi-infinite programming. OR Spektrum 10:145–152
Liu Y (2010) An exterior point method for linear programming based on inclusive normal cones. J Ind Manag Optim 6:825–846
Liu Y (2011) Duality theorem in linear programming: from trichotomy to quadrichotomy. J Ind Manag Optim 7:1003–1011
Liu Y (2014) New constraint qualification and optimality for linear semi-infinite programming (submitted)
Liu Y, Ding MF (2014) A ladder method for linear semi-infinite programming. J Ind Manag Optim 10:397–412
Liu Y, Teo KL (1999) A bridging method for global optimization. J Aust Math Soc Ser B 41:41–57
Reemtsen R, Göner S (1998) Numerical methods for semi-infinite programming: a survey. In: Reemtsen R, Rüchmann JJ (eds) Semi-infinite programming. Kluwer Academic, Netherlands, pp 195–275
Acknowledgments
The author of this paper wishes to thank the anonymous referees for pointing out various errors and suggesting improvements of the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Y. Generalized corner optimal solution for LSIP: existence and numerical computation. TOP 24, 19–43 (2016). https://doi.org/10.1007/s11750-015-0374-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-015-0374-z