Abstract
An augmented Lagrangian method is proposed for handling the common rows in large scale linear programming problems with block-diagonal structure and linking constraints. Using a diagonal quadratic approximation of the augmented Lagrangian one obtains subproblems that can be readily solved in parallel by a nonlinear primal-dual barrier method for convex separable programs. The combined augmented Lagrangian/barrier method applies in a natural way to stochastic programming and multicommodity networks.
Original language | English (US) |
---|---|
Pages (from-to) | 205-215 |
Number of pages | 11 |
Journal | Operations Research Letters |
Volume | 12 |
Issue number | 4 |
DOIs | |
State | Published - Oct 1992 |
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
Keywords
- decomposition
- linear programming
- stochastic programming