Volume 64 | Number 2 | Year 2018 | Article Id. IJMTT-V64P511 | DOI : https://doi.org/10.14445/22315373/IJMTT-V64P511
Martha Srinivas, "A Key Note on Dual Simplex Method," International Journal of Mathematics Trends and Technology (IJMTT), vol. 64, no. 2, pp. 72-73, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V64P511
[1] Robert Fourer. Notes on the dual simplex method. Draft report, 1994.
[2] C. E. Lemke. The dual method of solving the linear programming problem. Naval Research Logistics Quarterly, 1:36–47, 1954.
[3] R. E. Bixby and A. Martin. Parallelizing the dual simplex method. INFORMS Journal on Computing, 12(1):45–56, 2000.
[4] Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3–15, 2002.
[5] Brearley, A.L., Mitra, G., Williams, H.P.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 15, 54–83, 1975.
[6] Martha Srinivas, Tabular form of revised simplex method, Journal of Global Research and mathematical archives, Vol 5, No 6, 53-56, 2018.