Abstract
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP and standard semi-infinite problems (SIP) is illustrated by examples. By applying the `Reduction Ansatz', optimality conditions for GSIP are derived. Numerical methods for solving GSIP are considered in comparison with methods for SIP. From a theoretical and a practical point of view it is investigated, under which assumptions a GSIP can be transformed into an SIP.
Original language | Undefined |
---|---|
Pages (from-to) | 301-313 |
Number of pages | 13 |
Journal | European journal of operational research |
Volume | 119 |
Issue number | 119 |
DOIs | |
Publication status | Published - 1999 |
Keywords
- Numerical methods
- Semi-infinite programming
- IR-74018
- METIS-140567
- Optimality conditions