You are here

The Limitations of TORA Software in Solving Linear Programming Problems: Case of the Unrevised Simplex Method

Journal Name:

Publication Year:

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
In this paper, in the case of the Unrevised Simplex Method (USM), we show that the TORA software is applicable only in solving Linear Programming Problem (LPP) when the matrix associated to the initial basis is an identity matrix. We show that if the matrix associated to the initial base is any, we obtain the same result as that obtained using the TORA software.
49
51

REFERENCES

References: 

[1] R. A. LAKSHMI and P.L. PALLAVI, ‘‘A New Approach to Study Transportation Problem Using South West Corner Rule”, International Journal of Advanced Research Foundation, 2 (Issue 12)(2015).
[2] P. L. PALLAVI and R.A. LAKSHMI, ‘‘A Mat Lab Oriented Approch to Solve the Transportation Problem”, International Journal of Advanced Research Foundation, 2(Issue 11) (2015).
[3] K.C. RAO and S.L. MISHRA, “Operations research”, Alpha Science, Harrow, U.K. (2005).
[4] S. K. BOSE, “Operations Research”, Alpha Science, Harrow, U.K. (2005).
[5] Dantzig,G.B.,“Linear programming and extensions”, Princeton, NJ: Princeton University press, 1963.
[6] Stormy Attaway, MATLAB: A Pratical Introduction to Programming and Problem Solving, Elsevier, Inc 2009.
[7] François Ndayiragije, “Sur la méthode du simplexe ordinaire”, Afrique Science, Vol.12, N°6 (2016), http://www.afriquescience.net/numero6.html.
[8] L. Amyotte, “L’algèbre linéaire et ses applications” Erpi, 3è edition, Québéc, Canada (2009).
[9] Taha Hamdy A., “Operations Research: An introduction”, Printice-Hall of India, 8th edition. 2006.
[10] Taha, H.A., “Operations Research: An introduction”, Printice hall 7th edition, Prentice Hall, New Jersey (2003).

Thank you for copying data from http://www.arastirmax.com