A bilevel linear programming problem with bottleneck objectives (Q1342871)
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 bilevel linear programming problem with bottleneck objectives |
scientific article; zbMATH DE number 711722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bilevel linear programming problem with bottleneck objectives |
scientific article; zbMATH DE number 711722 |
Statements
A bilevel linear programming problem with bottleneck objectives (English)
0 references
15 January 1995
0 references
bilevel programming
0 references
linear constraints
0 references
sum of two concave bottleneck functions
0 references
0.97263103723526
0 references
0.8478569984436035
0 references
0.8286551833152771
0 references
0.8248334527015686
0 references
0.8169574737548828
0 references
