Abstract
SYNOPTIC ABSTRACTThis paper presents a variation of the restricted simplicial decomposition (RSD) algorithm especially designed for solving nonlinear network problems with unrestricted arc flows and an objective function that is separable, strictly convex and symmetric with respect to the origin. These problems have the drawback that the standard linear subproblem of RSD is unbounded. However, their optimal solution is in the convex hull of a set of spanning tree solutions. The proposed algorithm uses a new linearized subproblem with nonnegative arc costs in a directed network, thereby avoiding negative cycles and guaranteeing the generation of a spanning tree at each iteration. Computational results are presented for some large-scale electrical networks and water distribution problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: American Journal of Mathematical and Management Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.