Verified Linear Programming through Tolerance-Aware Precision Boosting
From MaRDI portal
Cites work
- -decidability over the reals
- A linear programming bound for orthogonal arrays with mixed levels
- A stabilization of the simplex method
- Algorithms and certificates for exact mixed integer programming
- An overview on the simplex algorithm
- Benchmarking optimization software with performance profiles
- Combining precision boosting with LP iterative refinement for exact linear optimization
- Computational techniques of the simplex method
- Exact solutions to linear programming problems
- Iterative refinement for linear programming
- Linear Programming
- Linear programming using limited-precision oracles
- New Finite Pivoting Rules for the Simplex Method
- On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations
- Parallelizing the dual revised simplex method
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- The Product Form for the Inverse in the Simplex Method
- Understanding and using linear programming
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
This page was built for publication: Verified Linear Programming through Tolerance-Aware Precision Boosting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345620)