Asymptotic analysis of perturbed mathematical programs (Q1589952): Difference between revisions

The authors present a sensitivity analysis of the solutions of a parametric nonlinear programming problem where the feasible set is defined by finitely many equality and inequality constraints. Assuming that both the objective and the constraint functions are analytical in both the state variables and the parameter it is shown that, under weak assumptions, the solutions can be described as Puiseux series expansions in dependence of the parameter. The main tool for obtaining this result is an application of the Remmert-Stein representation theorem for complex analytic varieties.