Abstract
General semi-infinite optimization problems arise in a number of real-life applications and can often be solved by a numerical method which exploits the inherent bi-level structure of GSIP. In this work we have seen that strong optimality conditions for GSIP can only be formulated after a sound understanding of the topology of its feasible set. As numerical methods can in general only be expected to converge to a stationary point of GSIP, optimality conditions serve the important purpose to define the appropriate concept of stationarity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stein, O. (2003). Final Remarks. In: Bi-Level Strategies in Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 71. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9164-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9164-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4817-7
Online ISBN: 978-1-4419-9164-5
eBook Packages: Springer Book Archive