Simplicial decomposition for convex generalized networks

The simplicial decomposition algorithm is specialized to solve nonlinear programs with generalized network constraints. Large scale problems can be solved efficiently by capitalizing on the intrinsic structure of the generalized network basis in the subproblem steps. The performance of the master problem is improved using a forcing sequence strategy to solve the master inexactly in a controlled fashion. The resulting software system (GNSD) is capable of solving large problems from a wide variety of applications. The authors investigate tactics that affect its performance and compare GNSD with other nonlinear programming codes.