Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs
Awi Federgruen, Henry Groenevelt
Operations Research · 1986 · Volume 34 · Issue 2
Abstract
In the classical maximal flow problem, the objective is to maximize the supply to a single sink in a capacitated network. In this paper we consider general capacitated networks with multiple sinks: the objective is to optimize a general “concave” preference relation on the set of feasible supply vectors. We show that an optimal solution can be obtained by a marginal allocation procedure. An efficient implementation results in an adaptation of the augmenting path algorithm. We also discuss an application of the procedure for an investment company that deals in oil and gas ventures.
Keywords
482 network applications, 484 flow algorithms, 662 nonlinear programming algorithms
Enable JavaScript for citation tools and additional paper interactions.