Abstract:

Firstly,  on the basis of the condition of inequality group constraint to which correspond  longitudinal decomposition subproblems having solutions, via proving that corresponding reach vector is zero, we further proved that the optimal solutions of longitudinal subproblems comprise the large scale problem’s optimal solutions； then proposed the “order decoupling algorithm”  under particular conditions, which is used to solve the large scale goal programming model with trapezoidal structure； and finally  illustrated the iteration process and effectiveness of algorithm with examples.

Key words: trapezoid structure； large scale programming； order decoupling algorithm