Before revision: We present a strongly polynomial label-correcting algorithm for solving the feasibility of linear systems with two variables per inequality (2VPI). The algorithm is based on the Newton-Dinkelbach method for fractional combinatorial optimization .
After revision: We present an accelerated, or 'look-ahead' version of the Newton-Dinkelbach method for fractional combinatorial optimization .