Deriving the properties of linear bilevel programming via a penalty function approach (Q1962473)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1395686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deriving the properties of linear bilevel programming via a penalty function approach |
scientific article; zbMATH DE number 1395686 |
Statements
Deriving the properties of linear bilevel programming via a penalty function approach (English)
0 references
15 October 2000
0 references
linear bilevel programming
0 references
existence of a solution
0 references
penalty function approach
0 references
minimal penalty function parameter value
0 references
extreme points
0 references
Lagrangian duality
0 references
0.8457488417625427
0 references
0.8441802263259888
0 references
0.8406069278717041
0 references
0.8324260115623474
0 references
