Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-019-03216-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2936699287 / rank | |||
Normal rank | |||
Revision as of 19:47, 19 March 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
