The document describes how to use the simplex algorithm to solve a linear programming problem. It begins by choosing an initial basis and calculating a basic feasible solution. Then it calculates simplex multipliers and reduced costs of non-basic variables to determine if any should enter or leave the basis. The algorithm repeats this process of changing the basis until an optimal solution is found where all reduced costs are positive.

1. How to resolve a Linear Programming
Problem using Simplex Algorithm ?
Example

2. Simplex algorithm example

3. Let's choose a basis B and calculte a basic
feasible solution

4. Now we calculate the simplex multipliers and the
reduce cost of the non basic variable
We notice r1 is negative so he enter in the

5. X5 Leaves the basis

6. A new cycle of the algorithm with a new basis.

7. We repeat the same calculation with the new basis.
X2 enters in the basis

8. X1 leaves the basis

9. Another Basis, the sames steps.

10. All the reduced costs are positives.
We found our optimal solution !

11. Thank you for yout time !
.com
chal lenge
.my study
www