A partial cooperation model for non-unique linear two-level decision problems

DOI10.1016/S0377-2217(01)00225-9zbMATH Open1007.90032OpenAlexW1967744312MaRDI QIDQ1600980FDOQ1600980

Authors: Dong Cao, Lawrence C. Leung 

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

Recommendations

• A partial cooperation model for bilevel programming problems with finite reactions follower
• A decision model for linear bilevel problems with uncertain reaction and the related result analysis
• Stackelberg problems with followers in the grand coalition of a TU-game
• New approach to linear Stackelberg problems with multiple leaders-follower
• A new partial cooperation model for ill-posed bilevel programming problems

zbMATH Keywords

non-uniquenessintermediate solutionpartial cooperationtwo-level problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Cites Work

• Weak via strong Stackelberg problem: New results
• New Branch-and-Bound Rules for Linear Bilevel Programming
• A penalty function approach for solving bi-level linear programs
• Links between linear bilevel and mixed 0-1 programming problems
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Title not available (Why is that?)
• A solution method for the linear static Stackelberg problem using penalty functions
• Convex two-level optimization
• Title not available (Why is that?)
• Two-Level Linear Programming
• Characterizing an optimal solution to the linear bilevel programming problem
• Hierarchical optimization: An introduction
• Title not available (Why is that?)
• A theoretical approximation scheme for Stackelberg problems
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization

Cited In (17)

• On complexity of finding strong-weak solutions in bilevel linear programming
• Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming
• A partial cooperation model for bilevel programming problems with finite reactions follower
• Using penalty function and tabu search to solve cell formation problems with fixed cell cost.
• On a class of bilevel linear mixed-integer programs in adversarial settings
• A survey on bilevel optimization under uncertainty
• On bilevel optimization with inexact follower
• A new method for strong-weak linear bilevel programming problem
• A penalty function method for solving ill-posed bilevel programming problem via weighted summation
• A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
• A fuzzy algorithm for multilevel programming problems
• An exact penalty method for weak linear bilevel programming problem
• Regularization and approximation methods in Stackelberg games and bilevel optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography
• An analysis of interorganizational resource sharing decisions in collaborative knowledge creation
• Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm
• Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting

This page was built for publication: A partial cooperation model for non-unique linear two-level decision problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600980)