Goal programming is an efficient method whereby to solve multi-objective decision problem. However, with the increasing of problem scale, the computer time has been rapidly increased and even a general computer cannot perform. Therefore, it is important to decompose a large scale problem into smaller ones. In this paper, the authors discuss the dedcomposition of a kind of large scale goal programming problem and have proved the relationship between the large scale goal programming problem and the smaller scale problems. The general form of goal programming is:
