Solving generalized semi-infinite programs by reduction to simpler problems

The article intends to give a unifying treatment of different approaches to solve generalized semi-infinite programs by transformation to simpler problems. In particular dual-, penalty-, discretization-, reduction-, and Karush-Kuhn-Tucker (KKT)-methods are applied to obtain equivalent problems or re...

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 53; no. 1; pp. 19 - 38
Main Author: Still, G.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.02.2004
Subjects:
Discretization
Mathematics Subject Classifications 2000: 90C34
Parametric programming
Penalty methods
Semi-infinite programming with variable index sets
ISSN:0233-1934, 1029-4945
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The article intends to give a unifying treatment of different approaches to solve generalized semi-infinite programs by transformation to simpler problems. In particular dual-, penalty-, discretization-, reduction-, and Karush-Kuhn-Tucker (KKT)-methods are applied to obtain equivalent problems or relaxations of a simpler structure. The relaxations are viewed as a perturbation P τ of the original problem P, depending on a perturbation parameter τ > 0, and are analyzed by using parametric programming techniques. We give convergence results and results on the rate of convergence for the minimal values and the optimal solutions of P τ when τ tends toward 0. We review earlier studies and present new ones.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331930410001661190