An extended \(K\)th-best approach for linear bilevel programming (Q556123)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An extended \(K\)th-best approach for linear bilevel programming |
scientific article; zbMATH DE number 2175203
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extended \(K\)th-best approach for linear bilevel programming |
scientific article; zbMATH DE number 2175203 |
Statements
An extended \(K\)th-best approach for linear bilevel programming (English)
0 references
13 June 2005
0 references
The authors continue a previous work on \(K\)th-best approach for linear bilevel programming (BLP) problems. They analyse theoretical properties of linear BLP and develop an extended \(K\)th-best approach for linear BLP to deal with the proposed issue.
0 references
linear bilevel programming
0 references
\(K\)th-best approach
0 references
optimization
0 references
von Stackelberg game
0 references
0.9438876
0 references
0.9360943
0 references
0.9257976
0 references
0.91137826
0 references
0.9080316
0 references
0.9008777
0 references
