Strong duality for inexact linear programming
From MaRDI portal
Recommendations
Cites work
- Convex Analysis
- Duality for inexact linear programming problems∗
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Semi-Infinite Programming: Theory, Methods, and Applications
- Some generalization of inexact linear programming
- Strong Duality for Semidefinite Programming
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- Technical Note—Constraint Qualifications for Inexact Linear Programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Technical Note—Exact Solutions of Inexact Linear Programs
Cited in
(12)- scientific article; zbMATH DE number 5036103 (Why is no real title available?)
- Strong duality for infinite-dimensional vector-valued programming problems
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Semi-infinite programming
- Duality for inexact semi-infinite linear programming
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- On strong duality in linear copositive programming
- Linear semi-infinite programming theory: an updated survey
- scientific article; zbMATH DE number 3970516 (Why is no real title available?)
- Primal-dual stability in continuous linear optimization
- Cutting plane algorithms for robust conic convex optimization problems
This page was built for publication: Strong duality for inexact linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720275)