Exact arithmetic at low cost. -- A case study in linear programming

DOI10.1016/S0925-7721(99)00012-7zbMath0956.90018MaRDI QIDQ1807651

Bernd Gärtner

Publication date: 23 November 1999

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

linear programmingsimplex methodexact arithmetic LP-type problems

Mathematics Subject Classification ID

Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization ⋮ Exact solutions to linear programming problems ⋮ A generalized Sylvester identity and fraction-free random Gaussian elimination ⋮ Linear programming using limited-precision oracles ⋮ Iterative Refinement for Linear Programming ⋮ Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work

Uses Software

• CPLEX

This page was built for publication: Exact arithmetic at low cost. -- A case study in linear programming