Optimization Online


Sensitivity analysis for two-level value functions with applications to bilevel programming

Stephan Dempe (dempe***at***math.tu-freiberg.de)
Boris S. Mordukhovich (boris***at***math.wayne.edu)
Alain B. Zemkoho (zemkoho***at***daad-alumni.de)

Abstract: This paper contributes to a deeper understanding of the link between a now conventional framework in hierarchical optimization spread under the name of the optimistic bilevel problem and its initial more dicult formulation that we call here the original optimistic bilevel optimization problem. It follows from this research that, although the process of deriving necessary optimality conditions for the latter problem is more involved, the conditions themselves do not-to a large extent-diff er from those known for the conventional problem. It has been already well recognized in the literature that for optimality conditions of the usual optimistic bilevel program appropriate coderivative constructions for the set-valued solution map of the lower-level problem could be used, while it is shown in this paper that for the original optimistic formulation we have to go a step further to require and justify a certain Lipschitz-like property of this map. This occurs to be related to the local Lipschitz continuity of the optimal value function of an optimization problem constrained by solutions to another optimization problem; this function is labeled here as the two- level value function. More generally, we conduct a detailed sensitivity analysis for value functions of mathematical programs with extended complementarity constraints. The results obtained in this vein are applied to the two-level value function and then to the original optimistic formulation of the bilevel optimization problem, for which we derive veri able stationarity conditions of various types entirely in terms of the initial data.

Keywords: Bilevel programming, Coderivative, Lipschitz-like property, Sensitivity analysis, Two-level value function, MPCC value functions, Optimality conditions

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Nonlinear Optimization

Category 3: Nonlinear Optimization (Unconstrained Optimization )

Citation: Preprint 2011-07, Department of Mathematics and Computer Science, Technical University Bergakademie Freiberg, Freiberg, Germany, October 2011

Download: [PDF]

Entry Submitted: 11/03/2011
Entry Accepted: 11/03/2011
Entry Last Modified: 11/03/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society