Application of Change of Basis in the Simplex Method

Authors

  • Mehmet Hakan Özdemir Istanbul University

DOI:

https://doi.org/10.26417/ejser.v11i1.p41-49

Keywords:

change of basis, linear programming, simplex method, optimization, linear algebra1.

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.

Downloads

Published

2017-10-06