Generalized semi-infinite programming: Theory and methods

Share/Save/Bookmark

Still, G. (1999) Generalized semi-infinite programming: Theory and methods. European Journal of Operational Research, 119 (2). pp. 301-313. ISSN 0377-2217

[img] PDF
Restricted to UT campus only
: Request a copy
136kB
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.
Item Type:Article
Copyright:© 1999 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74018
Official URL:http://dx.doi.org/10.1016/S0377-2217(99)00132-0
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 140567