A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296)
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 reducibility method for the weak linear bilevel programming problems and a case study in principal-agent |
scientific article; zbMATH DE number 7244910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent |
scientific article; zbMATH DE number 7244910 |
Statements
A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (English)
0 references
8 September 2020
0 references
bilevel programming
0 references
duality theory
0 references
bilinear programming
0 references
principal-agent
0 references
0 references
0 references
0 references
0 references
0 references
0.8180482387542725
0 references
0.7991335391998291
0 references
0.7920542359352112
0 references
0.789061963558197
0 references
