The Simplex Method Approach to Linear Programming Solutions
Research Updates in Mathematics and Computer Science Vol. 6,
10 May 2024
,
Page 11-32
https://doi.org/10.9734/bpi/rumcs/v6/28
Abstract
The SIMPLEX METHOD (SM) is a fundamental technique in the optimization field [1, 2], designed specifically to solve linear programming problems manually with high efficiency and accuracy by understanding limitations, specifying decision variables,creating objective functions and defining the feasible region by using slack variables, tableaus, and pivot variables as a means of finding the optimal solution to an optimization problem.
Keywords:
- Objective function
- constraints,entering variables
- leaving variables
- optimal solution
How to Cite
Ahmed, G. A. (2024). The Simplex Method Approach to Linear Programming Solutions. Research Updates in Mathematics and Computer Science Vol. 6, 11–32. https://doi.org/10.9734/bpi/rumcs/v6/28