Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Hi-index | 0.00 |
This paper provides an effective modification to the big-M method which leads to reducing the iterations of this method, when it is used to recognize the infeasibility of linear systems.