Of the Shor Khachian Algorithm for Linear Programming

Résumé du livre

We give some modifications of the recent Shor-Khachian algorithm for linear programming and describe a numerically stable implementation. We are concerned with practical problems where user-supplied bounds can usually be provided. Our implementation allows constraint dropping and updates bounds on the optimal value, and should be able to terminate with an indication of infeasibility or with a provably good feasible solution in a moderate number of iterations.