Certifying feasibility and objective value of linear programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2079347
- Integral approximation of rays and verification of feasibility
- Validated infeasible interior-point predictor-corrector methods for linear programming
- Certificates of primal or dual infeasibility in linear programming
- scientific article; zbMATH DE number 1303552
Cites work
- scientific article; zbMATH DE number 1805736 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- scientific article; zbMATH DE number 1487490 (Why is no real title available?)
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- A Survey of Condition Number Estimation for Triangular Matrices
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Exact solutions to linear programming problems
- Integration of an LP solver into interval constraint propagation
- Safe bounds in linear and mixed-integer linear programming
- The final NETLIB-LP results
Cited in
(4)- Integral approximation of rays and verification of feasibility
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- A review of computation of mathematically rigorous bounds on optima of linear programs
Describes a project that uses
Uses Software
This page was built for publication: Certifying feasibility and objective value of linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453056)
