AN EXTENDED BRANCH AND BOUND ALGORITHM FOR BILEVEL MULTI-FOLLOWER DECISION MAKING IN A REFERENTIAL-UNCOOPERATIVE SITUATION
From MaRDI portal
Publication:3502951
DOI10.1142/S0219622007002459zbMath1135.90049MaRDI QIDQ3502951
Jie Lu, Chenggen Shi, Da Ruan, Guang-Quan Zhang
Publication date: 20 May 2008
Published in: International Journal of Information Technology & Decision Making (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50)
Related Items
Multilevel decision-making: a survey, Finding optimal strategies in a multi-period multi-leader-follower Stackelberg game using an evolutionary algorithm, Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming, FUZZY BILEVEL PROGRAMMING: MULTI-OBJECTIVE AND MULTI-FOLLOWER WITH SHARED VARIABLES, Fuzzy bilevel programming with multiple objectives and cooperative multiple followers, A FUZZY MULTI-OBJECTIVE BILEVEL DECISION SUPPORT SYSTEM, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- The \(K\)th-best approach for linear bilevel multi-follower programming
- A penalty function approach for solving bi-level linear programs
- An extended Kuhn-Tucker approach for linear bilevel programming
- On the definition of linear bilevel programming solution
- On bilevel multi-follower decision making: general framework and solutions
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Two-Level Linear Programming
- Multi-Objective Group Decision Making
- Unnamed Item