A strongly polynomial algorithm for a new class of linear inequalities1
O. V. Gorokh, Frank M. Werner · Optimization · 1995
In this paper a method for solving perfect systems of linear inequalities is presented. It is based on selecting and removing inessential constraints. This method is a strongly polynomial one for the class of systems of inequalities with a constant difference between the number of constraints and the number of variables.