An approximate programming method based on the simplex method for bilevel programming problem

DOI10.1016/j.camwa.2010.03.027zbMath1198.90363OpenAlexW2006427599MaRDI QIDQ604030

Kejun Zhu, Zhong-Ping Wan, Guang-Min Wang

Publication date: 8 November 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.03.027

zbMATH Keywords

smooth functionapproximate programming algorithmbilevel nonlinear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems

Cites Work

• Unnamed Item
• Some properties of the bilevel programming problem
• A smoothing method for mathematical programs with equilibrium constraints
• Practical bilevel optimization. Algorithms and applications
• Descent approaches for quadratic bilevel programming
• Foundations of bilevel programming
• A neural network approach to multiobjective and multilevel programming problems
• An overview of bilevel optimization
• On bilevel multi-follower decision making: general framework and solutions
• Computational Difficulties of Bilevel Linear Programming
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints