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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
