Application of Change of Basis in the Simplex Method
dc.contributor.author | Ă–zdemir, Mehmet Hakan | |
dc.date.accessioned | 2025-02-07T15:29:32Z | |
dc.date.available | 2025-02-07T15:29:32Z | |
dc.date.issued | 2018 | |
dc.department | TAÜ, İktisadi ve İdari Bilimler Fakültesi, İşletme Bölümü | en_US |
dc.description.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. | |
dc.identifier.citation | Ă–zdemir, Mehmet H. (2018). Application of Change of Basis in the Simplex Method. European Journal of Social Science Education and Research, 5 (3), 19-30. | |
dc.identifier.doi | 10.26417/ejser.v11i1.p41-49 | |
dc.identifier.endpage | 30 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.startpage | 19 | en_US |
dc.identifier.uri | https://hdl.handle.net/20.500.12846/1540 | |
dc.identifier.volume | 5 | en_US |
dc.language.iso | en | |
dc.relation.ispartof | European Journal of Social Science Education and Research | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Change of basis | en_US |
dc.subject | Linear programming | en_US |
dc.subject | Simplex method | en_US |
dc.subject | Optimization | en_US |
dc.subject | Linear algebra | en_US |
dc.title | Application of Change of Basis in the Simplex Method | |
dc.type | Article |