A cutting plane approach for solving linear bilevel programming problems (Q2808063)
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 cutting plane approach for solving linear bilevel programming problems |
scientific article; zbMATH DE number 6585515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane approach for solving linear bilevel programming problems |
scientific article; zbMATH DE number 6585515 |
Statements
A Cutting Plane Approach for Solving Linear Bilevel Programming Problems (English)
0 references
26 May 2016
0 references
linear bilevel programming problem
0 references
quadratic programming
0 references
cutting plane
0 references
simplex algorithm pivot
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8718680739402771
0 references
0.8350335359573364
0 references
0.8256757259368896
0 references
0.8251628279685974
0 references
