Abstract:

The authors adopted “bidirectional decomposition” to decompose the large scale goal programming model with trapezoidal structure into several subproblems. Then the relations of their optimal solutions among the subproblems as well as those between the large scale multiobjective programming and each of its subproblems were studied. Under particular conditions, it has
been proved that the optimal solutions of transverse and longitudinal subproblems consist of the large scale problem’s optimal solutions.

Key words: large scale, goal programming model, trapezoidal structure, bidirectional decomposition