An artificial variable RZ decision method for geometric superfluity of condition constraint in linear programming problem

In this paper, based on the rotary iteration transformation in the simplex method, an artificial variable return-to-zero (RZ) algorithm is proposed to decide whether some condition constraint in linear programming problem is geometrically superfluous or not, as turns the decision problem of condition constraint geometric superfluity into such one whether condition constraint set of equations in its normalized form has such feasible basis solution in which every component corresponding to artificial variable is nought. Moreover, with the help of this method above, a feasible way to simplify linear programming problem is obtained.