![Bi-Level Strategies in Semi-Infinite Programming [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Bi-Level Strategies in Semi-Infinite Programming [electronic resource] /
Semi-infinite optimization is a vivid field of active research. Recently semi infinite optimization in a general form has attracted a lot of attention, not only because of its surprising structural aspects, but also due to the large number of applications which can be formulated as general semi-infinite programs. The aim of this book is to highlight structural aspects of general semi-infinite programming, to formulate optimality conditions which take this structure into account, and to give a conceptually new solution method. In fact, under certain assumptions general semi-infinite programs can be solved efficiently when their bi-Ievel structure is exploited appropriately. After a brief introduction with some historical background in Chapter 1 we be gin our presentation by a motivation for the appearance of standard and general semi-infinite optimization problems in applications. Chapter 2 lists a number of problems from engineering and economics which give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, ro bust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Boston, MA : Springer US : Imprint: Springer,
2003
|
| Subjects: | Mathematics., Computer mathematics., Convex geometry., Discrete geometry., Mathematical optimization., Calculus of variations., Optimization., Calculus of Variations and Optimal Control; Optimization., Computational Mathematics and Numerical Analysis., Convex and Discrete Geometry., |
| Online Access: | http://dx.doi.org/10.1007/978-1-4419-9164-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|