Dual Simplex Method

There are some basic differences between the primal simplex

and the dual simplex methods. The primal simplex method
starts from a non optimal feasible solution and moves towards
the optimal solution, maintaining feasibility every time. The
dual simplex method starts with an infeasible basic solution
(and therefore a ‘super’ optimal solution) and strives to
achieve feasibility, while satisfying optimality criterion every
time. In other words, in the dual simplex method, the earliest
iteration that gives a feasible solution is the optimal solution
sought, because optimality is maintained in each iteration. In
contrast, in the primal simplex method, feasibility is ensured
in each iteration, and the earliest iteration that meets the
optimality criterion is the optimal solution sought.
The dual simplex method, like the primal simplex method, has
rules for the entering variable, the departing variable and
testing the feasibility of a solution. The method will be
illustrated by an example problem for maximization. If the
objective is minimization, the objective function can be
written in the negative form for maximization, and the method
indicated herein may be applied.
Minimize Z = 2𝑥1 + 𝑥2