Application of Change of Basis in the Simplex Method

Mehmet Hakan Özdemir
Additional contact information
Mehmet Hakan Özdemir: Istanbul University

European Journal of Social Sciences Education and Research Articles, 2018, vol. 5

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.

Keywords: change of basis; linear programming; simplex method; optimization; linear algebra1. (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://brucol.be/index.php/ejser/article/view/6513 (text/html)
https://brucol.be/files/articles/ejser_v5_i3_18/Ozdemir.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eur:ejserj:132

DOI: 10.26417/ejser.v11i1.p41-49

Access Statistics for this article

More articles in European Journal of Social Sciences Education and Research Articles from Revistia Research and Publishing
Bibliographic data for series maintained by Revistia Research and Publishing ().