Maximum entropy approach for solving pessimistic bilevel programming problems
From MaRDI portal
Publication:5371903
DOI10.1007/s11859-017-1217-6zbMath1389.90317OpenAlexW2570904163MaRDI QIDQ5371903
Jingxiao Chen, Xiangzhi Zhuo, Yue Zheng
Publication date: 20 October 2017
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-017-1217-6
Related Items
The Standard Pessimistic Bilevel Problem ⋮ Methods for Pessimistic Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions for pessimistic semivectorial bilevel programming problems
- Weak nonlinear bilevel problems: existence of solutions via reverse convex and convex maximization problems
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Multilevel decision-making: a survey
- 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
- Topological existence and stability for Stackelberg problems
- An overview of bilevel optimization
- An exact penalty method for weak linear bilevel programming problem
- A solution approach to the weak linear bilevel programming problems
- Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems
- New results on approximate solution in two-level optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- On the computation of relaxed pessimistic solutions to MPECs
- Necessary optimality conditions in pessimistic bilevel programming
- Pessimistic Bilevel Optimization
