A sequential LCP method for bilevel linear programming (Q1184523)
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: A sequential LCP method for bilevel linear programming |
scientific article; zbMATH DE number 34725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sequential LCP method for bilevel linear programming |
scientific article; zbMATH DE number 34725 |
Statements
A sequential LCP method for bilevel linear programming (English)
0 references
28 June 1992
0 references
Bilevel Linear Programs
0 references
sequence of Linear Complementarity Problems
0 references
hybrid enumerative method
0 references
branch-and-bound
0 references
0 references
0.89889777
0 references
0.8899424
0 references
0.8897834
0 references
0.88553226
0 references
0.88392043
0 references
