• Login
    View Item 
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • Math Prog Technical Reports
    • View Item
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • Math Prog Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An e-Relaxation Algorithm for Convex Network Flow Problems

    Thumbnail
    File(s)
    An e-Relaxation Algorithm for Convex Network Flow Problems (224.8Kb)
    Date
    1995
    Author
    Zakarian, Armand
    Meyer, Robert R.
    De Leone, Renato
    Metadata
    Show full item record
    Abstract
    A relaxation method for separable convex network flow problems is developed that is well-suited for problems with large variation in the magnitude of the nonlinear cost terms. The arcs are partitioned into two sets, one of which contains only arcs corresponding to strictly convex dual pairs that satisfy complementary slackness on the strictly convex arc set and e-complementary slackness on the remaining arcs. An asynchronous parallel variant of the method is also developed. Computational results demonstrate that the method is significantly more efficient on ill-conditioned networks than existing methods, solving problems with several thousand nonlinear arcs in one second or less.
    Subject
    convex network flow
    Permanent Link
    http://digital.library.wisc.edu/1793/64913
    Type
    Technical Report
    Citation
    95-02
    Part of
    • Math Prog Technical Reports

    Contact Us | Send Feedback
     

     

    Browse

    All of MINDS@UWCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Contact Us | Send Feedback