1988
DOI: 10.1016/0191-2615(88)90006-9
|View full text |Cite
|
Sign up to set email alerts
|

A general bilevel linear programming formulation of the network design problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
57
0
1

Year Published

1998
1998
2018
2018

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 158 publications
(64 citation statements)
references
References 9 publications
0
57
0
1
Order By: Relevance
“…Ben-Ayed et al (1988) showed that even a simple linear bi-level programming problem is still NP-hard. Many bi-level programming problems are non-convex, and even when both upper and lower level problems are convex, there is no guarantee for the whole bi-level problems to be convex.…”
Section: Solution Procedures For the Problemmentioning
confidence: 99%
“…Ben-Ayed et al (1988) showed that even a simple linear bi-level programming problem is still NP-hard. Many bi-level programming problems are non-convex, and even when both upper and lower level problems are convex, there is no guarantee for the whole bi-level problems to be convex.…”
Section: Solution Procedures For the Problemmentioning
confidence: 99%
“…As is well known, bi-level programming optimization is a non-deterministic polynomial (NP) hard problem even in its most common formulation [38][39][40]. The decision variables of the government's upper-level mathematical model and the producers' lower-level mathematical models are therefore nested in each decision-maker's objective function and constraints of the model (10), for which an iterative interactive algorithm based on evolutionary game theory between the two decision-makers is established to deal with the complex model (10) interaction.…”
Section: Iterative Interactive Algorithmmentioning
confidence: 99%
“…From an optimisation point of view, this suggests a bi-level network design problem (NDP), with a classical general formulation in Ben-Ayed et al (1988). Typically NDPs have single objectives at both the lower and upper levels.…”
Section: Introductionmentioning
confidence: 99%