Solving linear bilevel multiobjective programming problem via exact penalty function approach (Q265140)
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: Solving linear bilevel multiobjective programming problem via exact penalty function approach |
scientific article; zbMATH DE number 6562132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving linear bilevel multiobjective programming problem via exact penalty function approach |
scientific article; zbMATH DE number 6562132 |
Statements
Solving linear bilevel multiobjective programming problem via exact penalty function approach (English)
0 references
1 April 2016
0 references
linear bilevel multiobjective programming
0 references
duality gap
0 references
penalty function
0 references
Pareto optimal solution
0 references
0 references
0 references
0.9922346
0 references
0.96101534
0 references
0.95125985
0 references
0.9436716
0 references
0.93454003
0 references
0.93414485
0 references
0.93032223
0 references
