Computation of efficient compromise arcs in convex quadratic multicriteria optimization (Q813340)
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: Computation of efficient compromise arcs in convex quadratic multicriteria optimization |
scientific article; zbMATH DE number 5005144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of efficient compromise arcs in convex quadratic multicriteria optimization |
scientific article; zbMATH DE number 5005144 |
Statements
Computation of efficient compromise arcs in convex quadratic multicriteria optimization (English)
0 references
8 February 2006
0 references
Benson's method
0 references
Domination Problem
0 references
Multicriteria optimization
0 references
Quadratic functions
0 references
Stability
0 references
0 references
0.7631036043167114
0 references
0.7543362975120544
0 references
0.7136479616165161
0 references
0.7116994261741638
0 references
