Network flows with age dependent decay rates (Q1060129)

An arc-chain linear programming formulation of 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 the arc, the commodity and the age of the commodity as it enters the arc 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.