Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403)

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.