Abstract
The optimal flow problem in networks with gains is presented through the simplex method. Out of simple theorical conditions, a method is built which needs only a relatively small number memory and quite a short calculation time by computer. Large examples are given; e.g., one test-example of 1000 nodes and 3000 arcs, and one real problem leading to a linear program of 3000 constraints and 8000 arcs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge,Théorie des graphes et ses applications (Dunod, Paris, 1958) p. 29.
C. Berge and A. Ghonile-Houri,Programmes jeux et reseaux de transport (Dunod, Paris, 1962) p. 122.
P. Broise, P. Huard and J. Sentenac,Décomposition des programmes mathématiques, Monographies de recherche opérationnelle (Dunod, Paris, 1967).
M. Gondran, Oral communication.
W.S. Jewell, “Optimal flow through networks with gains,” (Interim technical report no.8, Massachussetts Institute of Technology, Cambridge, Mass., 1958).Operations Research 10 (1962) 476–499.
E.L. Johnson, “Networks and basic solutions,”Operations Research 14 (1966) 619–623.
E.L. Johnson, “Programming in networks and graphs,” ORC 65-1. University of California, Berkeley.
D. Lacaze, “Flot optimal dans les réseaux avec multiplicateurs,”Revue Française de Recherche Opérationnelle 37 (1965) 271–293.
J.F. Maurras, “Méthode primale d'optimisation du flot dans un réseau avec multiplicateurs,” Note interne EDF (5.3.71).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maurras, J.F. Optimization of the flow through networks with gains. Mathematical Programming 3, 135–144 (1972). https://doi.org/10.1007/BF01584985
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584985