Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398)
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: Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials |
scientific article; zbMATH DE number 7142985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials |
scientific article; zbMATH DE number 7142985 |
Statements
Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (English)
0 references
12 December 2019
0 references
\(\epsilon\)-constraint method
0 references
multicriteria optimization
0 references
semidefinite programming
0 references
SOS-convex polynomials
0 references
0 references
0 references
0 references
0.9428797
0 references
0.92946315
0 references
0.9263674
0 references
0.91085315
0 references
0.8897232
0 references
0.88174754
0 references
0.87353015
0 references
