Algorithm
|
Dual simplex method Steps (Rule)
|
|
Step-1:
|
Formulate the Problem
a. Formulate the mathematical model of the given linear programming problem.
b. If the objective function is minimization type then change it into maximization type.
c. all `>=` constraint to `<=` constraint by multiply -1
d. Transform every `<=` constraint into an `=` constraint by adding a slack variable to every constraint and assign a 0 cost coefficient in the objective function.
|
|
Step-2:
|
Find out the Initial basic solution
Find the initial basic feasible solution by setting zero value to the decision variables.
That shown in the example-1
|
|
Step-3:
|
Test for Optimality
a. If all the values of `X_B >= 0`, then current solution is the optimal solution, terminate the process.
b. If any `X_B < 0`, then select the Minimum negative `X_B` and this row is called key row.
c. Find `"Ratio"=(C_j-Z_j)/"KeyRow"_j` and `"KeyRow"_j < 0`.
d. Find Minimum positive ratio, and this column is called key column.
e. Find the new solution table.
f. Repeat step-3.
|
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then
