ISSN:
1436-4646
Keywords:
Lagrangian Subproblem
;
Lagrangian Duality
;
Non-linear Discrete Programming
;
Separable Objective Function
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585097
Permalink