Practical application of simplex method for solving linear programming problems

  • Aleksandar Velinov Faculty of Computer Science, University "Goce Delcev", Shtip
  • Vlado Gicev Faculty of Computer Science, University "Goce Delcev", Shtip, Macedonia

Abstract

In this paper we consider application of linear programming in solving optimization problems with constraints. We used the simplex method for finding a maximum of an objective function. This method is applied to a real example. We used the “linprog” function in MatLab for problem solving. We shown how to apply simplex method on a real world problem, and to solve it using linear programming. Finally we investigate the complexity of the method via variation of the computer time versus the number of control variables.

Published
Aug 7, 2018
How to Cite
VELINOV, Aleksandar; GICEV, Vlado. Practical application of simplex method for solving linear programming problems. Balkan Journal of Applied Mathematics and Informatics, [S.l.], v. 1, n. 1, p. 07-15, aug. 2018. Available at: <http://js.ugd.edu.mk/index.php/bjami/article/view/2006>. Date accessed: 22 oct. 2018.
Section
Articles