Distance to Solvability/Unsolvability in Linear Optimization
From MaRDI portal
Recommendations
- Ill-posedness with respect to the solvability in linear optimization
- Characterization of total ill-posedness in linear semi-infinite optimization
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
Cited in
(17)- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Stability in linear optimization and related topics. A personal tour
- Marco A. López, a pioneer of continuous optimization in Spain
- Distances between optimal solutions of mixed-integer programs
- Radii of solvability and unsolvability of linear systems
- Feasible distance in non-conic convex optimization problems
- Generic primal-dual solvability in continuous linear semi-infinite programming
- LP relaxations for a class of linear semi-infinite programming problems
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- Primal, dual and primal-dual partitions in continuous linear optimization
- Stability and continuity in robust optimization
- Measuring the stability. A paradigmatic problem in optimization
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Characterization of total ill-posedness in linear semi-infinite optimization
- Primal-dual stability in continuous linear optimization
This page was built for publication: Distance to Solvability/Unsolvability in Linear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470213)
