Bi-level strategies in semi-infinite programming
Bi-level strategies in semi-infinite programming2003
About this book
This is the first book that exploits the bi-level structure of semi-infinite programming systematically. It highlights topological and structural aspects of general semi-infinite programming, formulates powerful optimality conditions, which take this structure into account, and gives a conceptually new bi-level solution method. The results are motivated and illustrated by a number of problems from engineering and economics that give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, robust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming. Audience: The book is suitable for graduate students and researchers in the fields of optimization and operations research.
Details
- First published
- 2003
- OL Work ID
- OL13469841W
Subjects
Linear programmingProgramming (Mathematics)MathematicsComputer scienceDiscrete groupsMathematical optimizationOptimizationCalculus of Variations and Optimal Control; OptimizationComputational Mathematics and Numerical AnalysisConvex and Discrete Geometry