Solving and Applying a Class of Block diagonal Structured Large Linear Programming

Using large block diagonal structured linear problem as illustration, we present the "gradient simplex" method for solving large linear problem.In solving some large block diagonal structured linear problem with fewer coupling constrants, this method is much faster then the simplex method, and can surmount the capacity and speed restrictions of computer to certain extent.In this paper, we discuss the efficiency and applicability of the method and analysis its performance in the examples of economic development optimize programming model.