Practical application of simplex method for solving linear programming problems

Velinov, Aleksandar and Gicev, Vlado (2018) Practical application of simplex method for solving linear programming problems. Balkan Journal of Applied Mathematics and Informatics, 1 (1). pp. 7-15. ISSN 2545-4803

[img]
Preview
Text
document.pdf

Download (3293Kb) | Preview
Official URL: http://js.ugd.edu.mk/index.php/bjami

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.

Item Type: Article
Subjects: Natural sciences > Computer and information sciences
Divisions: Faculty of Computer Science
Depositing User: Aleksandar Velinov
Date Deposited: 13 Aug 2018 09:57
Last Modified: 13 Aug 2018 09:57
URI: http://eprints.ugd.edu.mk/id/eprint/20296

Actions (login required)

View Item View Item