Date of Publication :7th June 2016
Abstract: The main aim of our application is to implement Simplex method using C. The Simplex Method is the classic method for solving LP problems, one of the most important algorithms ever invented. Invented by George Danzig in 1947 (Stanford University).Based on the iterative improvement idea. Generates a sequence of adjacent points of the problem’s feasible region with improving values of the objective function until no further improvement is possible. This paper presents the result of Simplex method using C project. The objective and scope of this project is to manage and simplify the task and reduce the paper work.
Reference :
-
- V. Boyer, D. El Baz, M. Elkihel, “Dense dynamic programming on multi GPU,” in Proc. of the 19th International Conference on Parallel Distributed and networked-based Processing, PDP 2011, Ayia Napa, Cyprus, 545–551, February 2011
- E. B. Ford, “Parallel algorithm for solving Keplers equation on graphics processing units: application to analysis of Doppler exoplanet searches,” New Astronomy, 14:406-412, 2009
- G. B. Dantzig, Linear Programming and Extensions. NJ: Princeton, Princeton University Press, 1963
- K. H. Borgwardt, “Some distribution independent results about the asymptotic order of the average number of pivot steps in the Simplex method”, Mathematics of Operations Research, vol. 7, no. 3, pp. 441-462, 198
- A. Schrijver, Theory of linear and integer programming. John Wiley& Sons, 1986.
- S. Lin and D. Costello, Jr., Error Control Coding, 2nd ed. Upper Saddle sRiver, NJ: Prentice-Hall, Inc., 2004.
- D. G. Spampinato, A. C. Elster, “Linear optimization on modern GPUs,” in Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium, (IPDPS 2009), Rome, Italy, May 2009.
- CUDA - CUBLAS Library 2.0, NVIDIA Corporation,
- LAPACK Library, http://www.culatools.com/