Abstract
A GPU-based parallel algorithm to solve large scale linear programming problem is proposed in this research. It aims to improve the computing efficiency when the linear programming problem becomes sufficiently large scale or more complicated. This parallel algorithm, based on Gaussian elimination, uses the GPU (Graphics Processing Unit) for computationally intensive tasks such as basis matrix operation, canonical form transformation and entering variable selection. At the same time, CPU is used to control the iteration. Experimental results show that the algorithm is competitive with CPU algorithm and can greatly reduce the computing time, so the GPU-based parallel algorithm is an effective way to solve large scale linear programming problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Papadimitrious, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Printice-Hall Inc., Englewood Cliffs (1992)
Marriott, K., Stuckey, P.J.: Programming with Constraints An Introduction. The MIT Press, Cambridge (1998)
Paparrizos, K.: An infeasible exterior point simplex algorithm for assignment problems. Mathematical Programming 51(1-3), 45–54 (1991)
Luh, H., Tsaih, R.: An efficient search direction for linear programming problems. Computers and Operations Research 29(2), 195–203 (2002)
Nwana, V., Darby-Dowman, K., Mitra, G.: A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound. European Journal of Operational Research 164, 12–23 (2005)
Lyu Jr, J., Luh, H., Lee, M.-c.: Performance analysis of a parallel dantzig-wolfe decomposition algorithm for linear programming. Computers and Mathematics with Applications 44, 1431–1437 (2002)
Maros, I., Mitra, G.: Investigating the sparse simplex algorithm on a distributed memory multi processor. Parallel Computing 26, 151–170 (2000)
Li, J.M., Wan, D.L., Chi, Z.X., Hu, X.P.: An Efficient Fine-Grained Parallel Particle Swarm Optimization Method based on GPU-acceleration. International Journal of Innovative Computing, Information and Control 3(6), 1707–1714 (2007)
Harris, M.J., Coombe, G.: Physically-based Visual Simulation on Graphics Hardware. In: Proceedings of Graphics Hardware, pp. 109–118 (2002)
Jowens, J.D., Luebke, D., Govindaraju, N.: A survey of general purpose computation on graphics hardware. Euro-Graphics 2005, 21–51 (2005)
Li, J.-m., Chi, Z.-x., Wan, D.-l.: A Parallel Genetic Algorithm Based on Fine-grained Model With GPU-Accelerated. Journal of Harbin Institute of Technology 23(6), 697–704 (2008)
O’Leary, D.P., Jun, J.H.: Implementing an Interior Point Method for Linear Programs on a CPU-GPU System. Electronic Transactions on Numerical Analysis 28, 174–189 (2008)
Wang, G.M., Wan, Z.P., Wang, X.J.: Genetic algorithm based on simplex method for solving linear-quadratic bi-level programming problem. Computers & Mathematics with Applications 56(10), 2550–2555 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Lv, R., Hu, X., Jiang, Z. (2011). A GPU-Based Parallel Algorithm for Large Scale Linear Programming Problem. In: Watada, J., Phillips-Wren, G., Jain, L.C., Howlett, R.J. (eds) Intelligent Decision Technologies. Smart Innovation, Systems and Technologies, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22194-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22194-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22193-4
Online ISBN: 978-3-642-22194-1
eBook Packages: EngineeringEngineering (R0)