Journal article
An Alternative to the Simplex Method for Solving Linear Programming Problems: A Managerial Perspective
International journal of management, Vol.27(2), p326
01 Aug 2010
Abstract
The objective of this paper is to develop a simpler alternative to the widely-used Simplex Method for solving linear programming problems, from the perspective of practicing managers. It allows bounded variables where the lower and upper bounds could be negative or positive, therefore eliminating the need for introducing additional variables for the purpose of preserving non-negativity. The variables upper bounds do not require additional constraints. The inequality constraints are handled through slack/surplus variables. In contrast to the Simplex Method there is no need for substituting variables and all operations are performed only on the original equations. This method can not only form the basis for more efficient computer programs, but can also enable linear programming problems to be more easily taught to a larger audience than at present, that includes practicing managers. [PUBLICATION ABSTRACT]
Metrics
10 Record Views
Details
- Title
- An Alternative to the Simplex Method for Solving Linear Programming Problems: A Managerial Perspective
- Creators
- Benjamin LevKrzysztof Kowalski
- Publication Details
- International journal of management, Vol.27(2), p326
- Publisher
- International Journal of Management
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Decision Sciences (and Management Information Systems)
- Identifiers
- 991019238899304721