Abstract

This paper considers the problem of maximizing the output flow in a multicommodity network in which flow entering an arc experiences a decay rate which is a function of three factors: the arc, the commodity, and the age of the commodity as it enters the arc. An arc-chain linear programming formulation of the problem is given. The algorithm for solving the problem involves a novel column generation scheme for basis entry embedded in the revised simplex algorithm. An efficient algorithm for generating, at each iteration, such a column is provided and illustrated with a numerical example.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.