Generalized Semi-Infinite Programming: Theory, Methods

Georg J. Still

Research output: Contribution to journalArticleAcademicpeer-review

62 Citations (Scopus)


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 languageUndefined
Pages (from-to)301-313
Number of pages13
JournalEuropean journal of operational research
Issue number119
Publication statusPublished - 1999


  • Numerical methods
  • Semi-infinite programming
  • IR-74018
  • METIS-140567
  • Optimality conditions

Cite this