Determination of optimal vertices from feasible solutions in unimodular linear programming

In this paper the authors consider a linear programming problem with the underlying matrix unimodular, and the other data integer. Given arbitrary near optimum feasible solutions to the primal and the dual problems, they obtain conditions under which statements can be made about the value of certain variables in optimal vertices. Such results have applications to the problem of determining the stopping criterion in interior point methods like the primal-dual affine scaling method and the path following methods for linear programming.