Abstract
The paper concerns a large-scale linear programming problem having a block-diagonal structure with coupling constraints. It is shown that there are deep connections between the Lagrange relaxation techniques and the Dantzig-Wolfe decomposition methods
| Original language | English |
|---|---|
| Journal | Control and Cybernetics |
| Volume | 18 |
| Issue number | 3-4 |
| Pages (from-to) | 43-48 |
| ISSN | 0324-8569 |
| Publication status | Published - 1989 |