Abstract
The simplex method is a very useful method to solve linear programming problems. It gives us a systematic way of examining the vertices of the feasible region to determine the optimal value of the objective function. It is executed by performing elementary row operations on a matrix that we call the simplex tableau. It is an iterative method that by repeated use gives us the solution to any n variable linear programming model. In this paper, we apply the change of basis to construct following simplex tableaus without applying elementary row operations on the initial simplex tableau.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call