Abstract
This paper presents an application of parallel computing techniques to the solution of an important class of planning problems known as generalized networks. Three parallel primal simplex variants for solving generalized network problems are presented. Data structures used in a sequential generalized network code are briefly discussed and their extension to a parallel implementation of one of the primal simplex variants is given. Computational testing of the sequential and parallel codes, both written in Fortran, was done on the CRYSTAL multicomputer at the University of Wisconsin, and the computational results are presented. Maximum efficiency occurred for multiperiod generalized network problems where a speedup approximately linear in the number of processors was achieved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Aronson,Survey of Dynamic Network Flows, Technical Report 85-OR-12 (Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, 1985).
E. Balas andP. Ivanescu (Hammer), On the generalized transportation problem,Management Sci. 11 (1964) 188–202.
R. Barr, F. Glover andD. Klingman, Enhancements of spanning tree labeling procedures for network optimization,INFOR 17 (1979) 16–34.
J. Bookbinder andS. Sethi, The dynamic transportation problem: A survey,Naval Res. Logistics Quart. 27 (1980) 447–452.
G. Brown andR. McBride, Solving generalized networks,Management Sci. 30 (1984) 1497–1523.
M. Chang andM. Engquist, On the number of quasi-trees in an optimal generalized network basis,MSP Committ. Algorithms Newslett. 14 (1986) 5–9.
A. Charnes andW. Cooper,Management Models and Industrial Applications of Linear Programming, Vol. I and II (Wiley, New York, 1961).
G. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, 1963).
D. De Witt, R. Finkel andM. Solomon,The CRYSTAL Multicomputer: Design and Implementation Experience, Technical Report 553 (Department of Computer Sciences, University of Wisconsin, Madison, 1984).
E. Dijkstra,Cooperating Sequential Processes, Technical Report EWD-123 (Technical University, Eindhoven, The Netherlands, 1965).
J. Dongarra, F. Gustavson andA. Karp, Implementing linear algebra algorithms for dense matrices on a vector pipeline machine,SIAM Rev. 26 (1984) 91–112.
J. Elam, F. Glover andD. Klingman, A strongly convergence primal simplex algorithm for generalized networks,Math. Oper. Res. 4 (1979) 39–59.
M. Engquist andM. Chang, New labeling procedures for the basis graph in generalized networks,Oper. Res. Letters 4 (1985) 151–155.
B. Feijoo andR. Meyer,Optimization of the CRYSTAL Multicomputer, Technical Report 562 (Department of Computer Sciences, University of Wisconsin, Madison, 1984).
R. Fourer, Solving staircase linear programs by the simplex method, 1: Inversion,Math. Progr. 23 (1982) 174–313.
R. Fourer, Solving staircase linear programs by the simplex method, 2: Pricing,Math. Program. 25 (1983) 251–292.
P. Gill, W. Murray, M. Saunders, J. Tomlin andM. Wright, A note on interiorpoint methods for linear programming,MPS Committ. Algorithms Newslett. 13 (1985) 13–18.
F. Glover andD. Klingman, A note on computational simplifications in solving generalized transportation problems,Transport. Sci. 7 (1973) 351–361.
F. Glover, J. Hultz, D. Klingman andJ. Stutz, Generalized networks: A fundamental computer based planning tool,Management Sci. 24 (1978) 1209–1220.
F. Glover, D. Klingman andJ. Stutz, Extension of the augmented predecessor index method to generalized network problems,Transport. Sci. 7 (1973) 377–384.
N. Karmarkar, A new polynomial time algorithm for linear programming, in:Proc. 16th Annual ACM Symp. Theory of Computing (1984) 302–311.
J. Kennington, andR. Helgason Algorithms for Network Programming (Wiley, New York, 1980).
D. Klingman, A. Napier andG. Ross, A computational study of the effects of problem dimensions on solution times for transportation problem,J. ACM 22 (1975) 413–424.
D. Klingman, A. Napier andJ. Stutz, NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow problems,Management Sci. 20 (1974) 814–821.
J. Mulvey, Pivot strategies for primal-simplex network codes,J. ACM 25 (1978) 266–270.
B. Murtagh andM. Saunders, Large scale linearly constrained optimization,Math. Program. 14 (1978) 41–72.
A. Phillips andJ. Rosen,Multitasking Mathematical Programming Algorithms, Technical Report (Department of Computer Science, University of Minnesota, Minneapolis, 1986).
J. Plummer, L. Lasdon andM. Ahmed,Solving a Large Programming Problem on a Vector Processing Computer, Technical Report 85/86-3-1 (Department of General Business, University of Texas, Austin, 1985).
M. Quinn andN. Deo, Parallel graph algorithm,Comput. Surveys 16 (1984) 319–348.
V. Srinivason andG. Thompson, Benefit-cost analysis of coding techniques for the primal transportation algorithm,J. ACM 20 (1973) 194–213.
S. Zenios andJ. Mulvey,Nonlinear Network Programming on Vector Supercomputers, Technical Report EES-85-13 (Department of Civil Engineering, Princeton University, Princeton, 1986).
Author information
Authors and Affiliations
Additional information
This research was supported in part by NSF grants DCR-8503148 and CCR-8709952 and by AFOSR grant AFOSR-86-0194.
Rights and permissions
About this article
Cite this article
Chang, M.D., Engquist, M., Finkel, R. et al. A parallel algorithm for generalized networks. Ann Oper Res 14, 125–145 (1988). https://doi.org/10.1007/BF02186477
Issue Date:
DOI: https://doi.org/10.1007/BF02186477