Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782): Difference between revisions
From MaRDI portal
Latest revision as of 05:45, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming |
scientific article |
Statements
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (English)
0 references
28 February 2018
0 references
The authors consider conic linear programming (LP) problems. Contrary to standard linear programming, the Lagrange dual of a conic LP is in general not an exact dual. Here, the authors present exact duals and certificates of (weak) infeasibility for general conic LP. Moreover, they present some geometric statements, such as e.g. an exact characterization of when the linear image of a closed convex cone is closed.
0 references
conic linear programming
0 references
semidefinite programming
0 references
facial reduction
0 references
exact duals
0 references
exact certificates of infeasibility and weak infeasibility
0 references
closedness of the linear image of a closed convex cone
0 references
0 references
0 references
0 references
