A new method for strong-weak linear bilevel programming problem
From MaRDI portal
Publication:2514671
DOI10.3934/jimo.2015.11.529zbMath1304.90167OpenAlexW2321333195MaRDI QIDQ2514671
Yue Zheng, Guang-Min Wang, Shi-Hui Jia, Zhong-Ping Wan
Publication date: 3 February 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2015.11.529
critical pointpenalty methodbilevel programmingpartial cooperationpessimistic formulationoptimistic formulation
Related Items (12)
Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ A survey on bilevel optimization under uncertainty ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ On Bilevel Optimization with Inexact Follower ⋮ A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem ⋮ On a class of bilevel linear mixed-integer programs in adversarial settings ⋮ Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting ⋮ Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application ⋮ A solution approach to the weak linear bilevel programming problems ⋮ Stability for semivectorial bilevel programs ⋮ Necessary optimality condition for trilevel optimization problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak nonlinear bilevel problems: existence of solutions via reverse convex and convex maximization problems
- Bilevel programming: a survey
- Practical bilevel optimization. Algorithms and applications
- A penalty function approach for solving bi-level linear programs
- Bilevel and multilevel programming: A bibliography review
- A note on a penalty function approach for solving bilevel linear programs
- A partial cooperation model for non-unique linear two-level decision problems
- Foundations of bilevel programming
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- A polyhedral branch-and-cut approach to global optimization
- Weak via strong Stackelberg problem: New results
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- An overview of bilevel optimization
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On convergence rates of subgradient optimization methods
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Necessary optimality conditions in pessimistic bilevel programming
- Pessimistic Bilevel Optimization
- Convex Analysis
- A solution method for the linear static Stackelberg problem using penalty functions
This page was built for publication: A new method for strong-weak linear bilevel programming problem
