The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
type: Item
instance of: scholarly article
title: The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
zbMATH Open document ID: 1272.90086
published in: Mathematical Programming. Series A. Series B
publication date: 2013-05-06T00:00:00Z
review text: The authors study bilevel programming problems in finite-dimensional spaces. They present two reformulations and discuss for them corresponding constraint qualifications (CQ) and optimality conditions. Here, the partial calmness CQ is paid special attention: it is shown that this particular CQ is fulfilled in case the lower level problem is linear. Finally, the particular bilevel demand adjustment problem is discussed in this context.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 91A65
zbMATH DE Number: 6160894
zbMATH Keywords: bilevel programming
zbMATH Keywords: optimal value function
zbMATH Keywords: constraint qualifications
zbMATH Keywords: optimality conditions
zbMATH Keywords: demand adjustment problem
author: Stephan Dempe
author: Alain B. Zemkoho
reviewed by: Jan-Joachim Rückmann
MaRDI profile type: Publication
full work available at URL: s10107-011-0508-5
OpenAlex ID: W2102686659
cites work: New necessary optimality conditions in optimistic bilevel programming
cites work: New uniform parametric error bounds
cites work: Q4394594
cites work: Foundations of bilevel programming
cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints?
cites work: Variational Analysis in Bilevel Programming
cites work: Bilevel road pricing: theoretical analysis and optimality conditions
cites work: On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
cites work: The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
cites work: Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
cites work: Abadie-type constraint qualification for mathematical programs with equilibrium constraints
cites work: On calmness conditions in convex bilevel programming
cites work: Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
cites work: Bilevel programming in traffic planning: Models, methods and challenge
cites work: The Theory of Moral Hazard and Unobservable Behaviour: Part I
cites work: Maximum principle in the problem of time optimal response with nonsmooth constraints
cites work: Variational Stability and Marginal Functions via Generalized Differentiation
cites work: Subgradients of marginal functions in parametric mathematical programming
cites work: Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
cites work: Q3795499
cites work: On the numerical solution of a class of Stackelberg problems
cites work: On the convergence of descent methods for monotone variational inequalities
cites work: Convex Analysis
cites work: Variational Analysis
cites work: Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
cites work: Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
cites work: Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
cites work: Optimality conditions for bilevel programming problems
cites work: Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
DOI: 10.1007/S10107-011-0508-5
description: scientific article; zbMATH DE number 6160894