Abstract
Abstract The goal of this literature review is to give an update on the recent developments for semi-infinite programs (SIPs), approximately over the last 20 years. An overview of the different solution approaches and the existing algorithms is given. We focus on deterministic algorithms for SIPs which do not make any convexity assumptions. In particular, we consider the case that the constraint function is non-concave with respect to parameters. Advantages and disadvantages of the different algorithms are discussed. We also highlight recent SIP applications. The article closes with a discussion on remaining challenges and future research directions.
Sign-in/Register to access full text options 
Free) 
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 call
