The Sub-Optimal Effect of the Simplex Solution Method in Resource Allocation Using the Linear Programming Model
Enyi Patrick Enyi

Abstract
It is evident that linear programming model remains the most potent mathematical tool for the efficient allocation of scarce operational resources of an organization. Whilst projecting the graphical method as the easiest solution approach to linear programming where only two constraining factors are involved, the more complicated simplex method offers the freedom to solve problems involving more than two operational factors. A recent analysis of real life operational activities of a small manufacturing company using both methods to find the best mix for combining constraining resources for optimal performance, however, revealed that the simplex method though may be effective in dealing with multiple constraining factors, it does so at the price of sub-optimal decision solution truncating vital non-linear information ordinarily accounted for by other analytical methods. This paper suggests a modified approach to using the simplex method in solving business related linear programming problems to ensure optimal decision in resource allocation.

Full Text: PDF