Strong duality in robust convex programming: complete characterizations (Q3083336)
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: Strong duality in robust convex programming: complete characterizations |
scientific article; zbMATH DE number 5868744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong duality in robust convex programming: complete characterizations |
scientific article; zbMATH DE number 5868744 |
Statements
Strong Duality in Robust Convex Programming: Complete Characterizations (English)
0 references
21 March 2011
0 references
convex programming under uncertainty
0 references
robust optimization
0 references
strong duality
0 references
Lagrangian duality
0 references
cone constraint qualification
0 references
generalized Slater condition
0 references
characteristic cone
0 references
theorem of the alternative
0 references
parameterized inequality system
0 references
0.9051951169967652
0 references
0.8736815452575684
0 references
0.8728806972503662
0 references
0.8712274432182312
0 references
0.8565327525138855
0 references
