Solving a type of biobjective bilevel programming problem using NSGA-II (Q980261)
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 a type of biobjective bilevel programming problem using NSGA-II |
scientific article; zbMATH DE number 5727644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a type of biobjective bilevel programming problem using NSGA-II |
scientific article; zbMATH DE number 5727644 |
Statements
Solving a type of biobjective bilevel programming problem using NSGA-II (English)
0 references
28 June 2010
0 references
bilevel programming
0 references
two-level optimization
0 references
multiobjective evolutionary algorithms
0 references
decision-making
0 references
bargaining
0 references
0 references
0 references
0.767320990562439
0 references
0.7670390605926514
0 references
0.764502227306366
0 references
0.7635192275047302
0 references
