Abstract: A new linear programming decomposition algorithm, based upon the double decomposition, is developed. Firstly, teh basic double decomposition algorithm is introduced. Secondly, the basic idea of nested double decomncsition is discussed through the general triangular constrained linear programming problem. Thirdly, several available nested double decomposition algorithms are described. Finally, the application of the nested double decomposition algorithms are described. Finally, the application of the nested double decomposition algorithm to the structuref linear programming problems is briefly explaind and is shown that the algorithm presented here is effective on saving CPU time and memory.