This paper gives the Lagrangian dual coordinatewise maximization (LDCM) algorithm for network transportation problems with strictly convex quadratic costs (NTPQ). An explicit expression for the dual function associated with NTPQ is obtained. Some properties of the dual function are shown. Then, using these properties, a procedure which involves successively maximizing the dual function with respect to each of its dual coordinates is applied to obtain the optimal dual solution. Then the optimal primal solution is obtained by substituting the dual solution t o the simple expression. Computational results for 200 randomly generated problems reveal the effectiveness of the algorithm. The key idea of applying the Lagrangian dual method t o NTPQ is that the objective function of the network problems is strictly convex. This strict convexity allows one to finesse problems that occur in using Lagrangian methods with more general problems. In particular, because the optimal solution of the Lagrangian problem is unique, the dual function is differentiable and an optimal solution to the Lagrangian with optimal multipliers is optimal in the original primal problem. These are strong results that are not true in general.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.