The Simplex Method Approach to Linear Programming Solutions

Authors

  • Ghada A. Ahmed Department of mathematics, Faculty of Science, AL-Baha University, ALBaha, ALBaha, Saudia Arabia.

DOI:

https://doi.org/10.9734/bpi/rumcs/v6/28

Keywords:

Objective function, constraints,entering variables, leaving variables, optimal solution

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.

Downloads

Published

2024-05-10

How to Cite

Ghada A. Ahmed. (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

Issue

Research Updates in Mathematics and Computer Science Vol. 6

Section

Chapters