Abstract
In this paper, a parallel-vector simplex algorithm is developed for solving large-scale linear programming problems on distributed-memory computers. The algorithm uses the column storage scheme to enhance its overall performance. The effect of using different pivot rules on the performance of the simplex method on high-performance computers is also studied.
This is a preview of subscription content, log in via an institution to check access.
References
Hadley, G. 1963:Linear programming. Reading, Massachusetts: Addison-Wesley
Murty, K.G. 1976:Linear and combinational programming. New York: John Wiley & Sons
Baddourah, M.A.; Nguyen, D.T. 1991: Parallel-vector processing for linear programming.Comput. & Struct. 38, 269–282
Balinski, M.L.; Hellerman, E. (eds.) 1975: Computational practice in mathematical programming.Mathematical Programming Study 4
Schrijver, A. 1986:Theory of linear and integer programming. London: John Wiley & Sons
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Qin, J., Nguyen, D.T. A parallel-vector simplex algorithm on distributed-memory computers. Structural Optimization 11, 260–262 (1996). https://doi.org/10.1007/BF01197042
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01197042