Certifying feasibility and objective value of linear programs
From MaRDI portal
Publication:453056
DOI10.1016/J.ORL.2012.03.004zbMATH Open1247.90187OpenAlexW1964933337MaRDI QIDQ453056FDOQ453056
Daniel Dumitriu, Ernst Althaus
Publication date: 18 September 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.03.004
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The final NETLIB-LP results
- Safe bounds in linear and mixed-integer linear programming
- A Survey of Condition Number Estimation for Triangular Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact solutions to linear programming problems
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Title not available (Why is that?)
- Integration of an LP Solver into Interval Constraint Propagation
Cited In (4)
- Title not available (Why is that?)
- Integral approximation of rays and verification of feasibility
- 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
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)
