How to solve a semi-infinite optimization problem

Oliver Stein

European Journal of Operational Research, 2012, vol. 223, issue 2, 312-320

Abstract: After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems. Particular attention is paid to connections with mathematical programs with complementarity constraints, lower level Wolfe duality, semi-smooth approaches, as well as branch and bound techniques in adaptive convexification procedures. A section on recent genericity results includes a discussion of the symmetry effect in generalized semi-infinite optimization.

Keywords: Semi-infinite optimization; Design centering; Robust optimization; Adaptive convexification; Genericity (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171200464X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:223:y:2012:i:2:p:312-320

DOI: 10.1016/j.ejor.2012.06.009

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().