| Article ID: | iaor1991683 |
| Country: | Canada |
| Volume: | 29 |
| Issue: | 1 |
| Start Page Number: | 26 |
| End Page Number: | 37 |
| Publication Date: | Feb 1991 |
| Journal: | INFOR |
| Authors: | Van de Panne Cornelis, Coad Leonard |
| Keywords: | decomposition |
The paper deals with a method for solving a linear programming problem with a primal block-angular structure. Any basic solution of such a problem can be decomposed into a principal problem and the remaining independent subproblems. A dual method working on a infeasible principal problem interacts with all the remaining independent subproblems to yield an optimal solution to the entire problem. Some implementation results for primally and dually feasible initial solutions using randomly generated problems are given.