The Simplex Algorithm of Dantzig
Anand Mohan Sinha1, Kumar Mukesh2, Uma Shankar3
1Anand Mohan Sinha, Department of Mathematics, J. P. University, Chapra, Bihar, India.
2Kumar Mukesh, Department of Mathematics, R.P. Sharma Institute of Technology, Patna, Bihar, India.
3Uma Shankar, Department of Mathematics, K. K. College of Engineering & Management, Biharsharif, Bihar, India.
Manuscript received on September 07, 2014. | Revised Manuscript Received on September 18, 2014. | Manuscript published on September 20, 2014. | PP: 9-15 | Volume-2, Issue-10, September 2014. | Retrieval Number: J04950921014/2014©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering & Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this chapter, we put the theory developed in the last to practice. We develop the simplex method algorithm for LP problems given in feasible canonical form and standard form.
Keywords: Pivot operation, Feasible Canonical Form and Feasible standard Form .AMS Subject Classification 2010: 90C05