A Method For Solving Large Scale Linear Programming Problems
Zhao Xi nan · 2005
Although only simplex method is a well- known ripe method for solving linear programming problems in the practice, it is not good enough for large scale systems. The principal shortcoming is on calculation rate. In this paper, a search method is given out in solving procedure, with the method, certain passive constraints should be taken out, without adding whatever other calculation except several judgement links. Thus, the calculation amount can be largely reduced for large scale linear programming problems.