Question

When solving simplex algorithm, how do you choose the entering variable when both coefficients are equal go each other? the last time i posted this question someone responded with a full solution to a practice problem that didnt even explain the step i was questioning.

Answer 1

steps

1) Convert to the standard form

Slack varibles for less than or equal to

Surplus varibles for greater than equal to

In standard form all varibles greater than equal to zero all constrains equalities.

2) Add an artificial variable by checking slack and surplus varibles.

3) create an objective constrain.

Add new constrain Z

4) form initial table

1st column for basic varibles

Last for constrains

Between for each constrain

5) find the initial objective function

6) find the initial basic varible

7) Modify the Z row

If the basic varible is not zero, add appropriate multiple of row in which basic varible appears then entry become zero.

8) identifying an entry basic varible and pivot column.

9) identifying departing the basic variable and pivot row

10) then we get key value by checking key row and key cloumn.

11) repeat the steps untill find the feasibile solution.