On the continuity of the optimal set mapping of a convex programming problem (Q2563367): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:31, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the continuity of the optimal set mapping of a convex programming problem |
scientific article |
Statements
On the continuity of the optimal set mapping of a convex programming problem (English)
0 references
11 December 1996
0 references
The authors prove the Hausdorff continuity of the optimal mapping (as a function of the right hand sides) of the convex programming problem, in which the constraints are given by convex polynomials of degree \(\leq 4\), and the objective function is convex and weak analytic (including all the polynomials of arbitrary degree).
0 references
convex programming
0 references
convex polynomials
0 references
Hausdorff continuity
0 references
