A partial cooperation model for non-unique linear two-level decision problems
type: Item
instance of: scholarly article
title: A partial cooperation model for non-unique linear two-level decision problems
zbMATH Open document ID: 1007.90032
DOI: 10.1016/S0377-2217(01)00225-9
published in: European Journal of Operational Research
publication date: 2002-06-16T00:00:00Z
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 1756589
zbMATH Keywords: two-level problem
zbMATH Keywords: non-uniqueness
zbMATH Keywords: partial cooperation
zbMATH Keywords: intermediate solution
author: Dong Cao
author: Lawrence C. Leung
MaRDI profile type: Publication
cites work: Hierarchical optimization: An introduction
cites work: A solution method for the linear static Stackelberg problem using penalty functions
cites work: Links between linear bilevel and mixed 0-1 programming problems
cites work: Convex two-level optimization
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: Two-Level Linear Programming
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Q3997222
cites work: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
cites work: Characterizing an optimal solution to the linear bilevel programming problem
cites work: Q4524240
cites work: A theoretical approximation scheme for Stackelberg problems
cites work: Weak via strong Stackelberg problem: New results
cites work: Q3211108
cites work: A penalty function approach for solving bi-level linear programs
full work available at URL: s0377-2217(01)00225-9
OpenAlex ID: W1967744312
description: scientific article; zbMATH DE number 1756589