Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128119462, #quickstatements; #temporary_batch_1722357939539 |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-019-03216-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-019-03216-Z / rank | |||
Normal rank | |||
Latest revision as of 04:22, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data |
scientific article |
Statements
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (English)
0 references
5 May 2021
0 references
multiobjective optimization
0 references
robust optimization
0 references
semidefinite programming relaxations
0 references
SOS-convex polynomials
0 references
0 references
0 references
0 references
0 references
0 references
