The nonlinear bilevel programming problem:formulations,regularity and optimality conditions

DOI10.1080/02331939508844048zbMath0812.00045OpenAlexW2033573391MaRDI QIDQ4764600

No author found.

Publication date: 7 May 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

SymposiumMathematical programmingWashington, DC (USA)Data perturbations

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (12)

A new smoothing scheme for mathematical programs with complementarity constraints ⋮ Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm ⋮ Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications ⋮ Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints ⋮ Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization ⋮ Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints ⋮ Abadie-type constraint qualification for mathematical programs with equilibrium constraints ⋮ Optimization problems with equilibrium constraints and their numerical solution. ⋮ A modified relaxation scheme for mathematical programs with complementarity constraints ⋮ Hybrid approach with active set identification for mathematical programs with complementarity constraints ⋮ Partial exact penalty for mathematical programs with equilibrium constraints ⋮ A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints

Cites Work

• Unnamed Item
• On the structure and properties of a linear multilevel programming problem
• A sequential LCP method for bilevel linear programming
• The steepest descent direction for the nonlinear bilevel programming problem
• Optimality conditions for the bilevel programming problem
• Directional differentiability of the optimal value function in a nonlinear programming problem
• An Algorithm for Solving the General Bilevel Programming Problem
• Optimization and nonsmooth analysis
• A note on the optimality conditions for the bilevel programming problem
• On two-level optimization
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Two-Level Linear Programming
• Constraint qualifications in maximization problems
• Convex Analysis
• A solution method for the linear static Stackelberg problem using penalty functions

This page was built for publication: The nonlinear bilevel programming problem:formulations,regularity and optimality conditions