This paper presents an overview of some recent and significant progress in the theory of optimization with perturbations. We put the emphasis on methods based on upper and lower estimates of the value of the perturbed problems. These methods allow to compute expansions of the value function and approximate solutions in situations where the set of Lagrange multipliers may be unbounded, or even empty. We give rather complete results for nonlinear programming problems, and describe some partial extensions of the method to more general problems. We illustrate the results by computing the equilibrium position of a chain that is almost vertical or horizontal.
Publié le : 1996-07-05
Classification:
SEMI-INFINITE PROGRAMMING,
SEMI-DEFINITE PROGRAMMING,
SECOND ORDER ANALYSIS,
SENSITIVITY,
DUALITY,
EXPANSION OF SOLUTIONS,
CONSTRAINED OPTIMIZATION,
STABILITY,
[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH],
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{Report N°: RR-2872,
author = {Bonnans, J. Frederic and Shapiro, Alexander},
title = {Optimization Problems with perturbations : A Guided Tour},
journal = {HAL},
volume = {1996},
number = {0},
year = {1996},
language = {en},
url = {http://dml.mathdoc.fr/item/Report N°: RR-2872}
}
Bonnans, J. Frederic; Shapiro, Alexander. Optimization Problems with perturbations : A Guided Tour. HAL, Tome 1996 (1996) no. 0, . http://gdmltest.u-ga.fr/item/Report%20N%C2%B0:%20RR-2872/