Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods |
scientific article |
Statements
Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (English)
0 references
27 April 2012
0 references
The author considers primal and dual nonlinear constrained network flow problems. The dual problem is solved by approximate subgradient methods, where the dual function is estimated by minimizing approximately a Lagrangian function, which relaxes the side-constrains (non-network constraints) and is subject only to network constraints. In order to evaluate the quality of the solution and the efficiency of these methods, some of them have been implemented computationally.
0 references
nonlinear programming
0 references
Lagrangian relaxation
0 references
approximate subgradient methods
0 references
network flows
0 references