A partial cooperation model for non-unique linear two-level decision problems
From MaRDI portal
Publication:1600980
DOI10.1016/S0377-2217(01)00225-9zbMath1007.90032OpenAlexW1967744312MaRDI QIDQ1600980
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00225-9
Related Items (15)
Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm ⋮ A survey on bilevel optimization under uncertainty ⋮ A fuzzy algorithm for multilevel programming problems ⋮ On Bilevel Optimization with Inexact Follower ⋮ Using penalty function and tabu search to solve cell formation problems with fixed cell cost. ⋮ 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 ⋮ Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming ⋮ An exact penalty method for weak linear bilevel programming problem ⋮ A new method for strong-weak linear bilevel programming problem ⋮ A penalty function method for solving ill-posed bilevel programming problem via weighted summation ⋮ An analysis of interorganizational resource sharing decisions in collaborative knowledge creation ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theoretical approximation scheme for Stackelberg problems
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Convex two-level optimization
- Hierarchical optimization: An introduction
- A penalty function approach for solving bi-level linear programs
- Characterizing an optimal solution to the linear bilevel programming problem
- Links between linear bilevel and mixed 0-1 programming problems
- Weak via strong Stackelberg problem: New results
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Two-Level Linear Programming
- A solution method for the linear static Stackelberg problem using penalty functions
This page was built for publication: A partial cooperation model for non-unique linear two-level decision problems