Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints |
| |
| Authors: | M. E. Dyer J. Walker |
| |
| Affiliation: | (1) Mathematics and Statistics Department, Teesside Polytechnic, TS1 3BA Middlesbrough, Cleveland, England |
| |
| Abstract: | This note presents an efficient method for the routine solution of the subproblem associated with the Lagrangian dual of discrete programming problems having separable non-linear objective function and linear constraints. An additional advantage for subgradient methods is described. |
| |
| Keywords: | Lagrangian Subproblem Lagrangian Duality Non-linear Discrete Programming Separable Objective Function |
| 本文献已被 SpringerLink 等数据库收录！ |
