A necessary and a sufficient optimality condition for bilevel programming problems

DOI10.1080/02331939208843831zbMath0817.90104OpenAlexW2150459262MaRDI QIDQ4327952

Stephan Dempe

Publication date: 27 March 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843831

zbMATH Keywords

parametric optimizationcontingent derivativebilevel programmingnecessary and sufficient conditiondirectional differentiabilityhierarchical optimizationStackelberg gamesdifferential stabilitylocal optimal solutions

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Sensitivity, stability, parametric optimization (90C31)

Related Items (60)

Descent approaches for quadratic bilevel programming ⋮ Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints ⋮ Optimality conditions for bilevel programming problems ⋮ Bilevel and multilevel programming: A bibliography review ⋮ Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ Bilevel Optimization: Reformulation and First Optimality Conditions ⋮ Bilevel programming and applications ⋮ Computing optimal incentives via bilevel programming ⋮ New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem ⋮ Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers ⋮ First- and second-order optimality conditions in optimistic bilevel set-valued programming ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Bilevel optimization: on the structure of the feasible set ⋮ Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ New optimality conditions for bilevel programs by using an exact separation principle ⋮ Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach ⋮ Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs ⋮ Solving quadratic convex bilevel programming problems using a smoothing method ⋮ Optimality and duality results for bilevel programming problem using convexifactors ⋮ Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm ⋮ Unnamed Item ⋮ Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem ⋮ Necessary optimality conditions for bilevel minimization problems ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ An equivalent one level optimization problem to a semivectorial bilevel problem ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ An overview of bilevel optimization ⋮ A new equivalent single-level problem for bilevel problems ⋮ Direct search algorithm for bilevel programming problems ⋮ A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience ⋮ New necessary optimality conditions in optimistic bilevel programming ⋮ Second order optimality conditions for bilevel set optimization problems ⋮ Necessary optimality conditions for bilevel optimization problems using convexificators ⋮ Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles ⋮ Exact penalty functions for convex bilevel programming problems. ⋮ Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches ⋮ Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level ⋮ On strong and weak second-order necessary optimality conditions for nonlinear programming ⋮ On an algorithm solving two-level programming problems with nonunique lower level solutions ⋮ Weak via strong Stackelberg problem: New results ⋮ On the quasiconcave bilevel programming problem ⋮ Bilevel convex programming models ⋮ Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians ⋮ Optimality results for a specific bilevel optimization problem ⋮ Necessary optimality conditions of a D.C. set-valued bilevel optimization problem ⋮ Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:¹$f:¹partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Unnamed Item ⋮ Sufficient Optimality Conditions in Bilevel Programming ⋮ Bundle trust-region algorithm for bilinear bilevel programming

Cites Work

• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• A new constraint qualification condition
• Approximation to a set-valued mapping. I: A proposal
• Exact penalties and sufficient conditions for optimality in nonsmooth optimization
• Convex two-level optimization
• Dynamic noncooperative game theory
• A solution method for the static constrained Stackelberg problem via penalty method
• Optimality conditions for the bilevel programming problem
• Directional derivative of the marginal function in nonlinear programming
• Solution point differentiability without strict complementarity in nonlinear programming
• Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• A simple algorithm for the-linear bilevel programming problem
• Existence theorems of equilibrium points in stackelberg
• Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
• On the directional derivative of the optimal solution mapping without linear independence constraint qualification
• An elementary survey of general duality theory in mathematical programming
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming

This page was built for publication: A necessary and a sufficient optimality condition for bilevel programming problems