Column pricing with finite precision #31
Labels
area:pivoting
Area: Choosing the next column to pivot on
enhancement
Concerns algorithmic functionality rather than implementation details
Currently, the steepest descent pricing algorithm from Goldfarb and Tomlin is implemented in arbitrary precision. While useful as a reference implementation, it would be faster when implemented in finite precision. Numerical issues are not a big problem, as it would at most cause a slightly worse column to be pivoted on.
The text was updated successfully, but these errors were encountered: