Variants of Simplex

Method

1. Inequality in the wrong direction

2. Degeneracy
3. Minimisation
4. Unbounded solution
5. Multiple solutions
6. Non existing Feasible solution
7. Unrestricted variables

Minimisation
The second method is to change problem into an
equivalent problem involving maximization and
proceed with the steps of the regular simplex method.
The change is effected by maximizing the negative of the
original objective function. Minimizing any function f (x1,

x2, x3, ..., xn) subject to set of constraints is completely

equivalent to maximizing -f (x1, x2, ..., xn) subject to the
same set of constraints. For example if we want to
minimize a function Z = 7x1 +9x2 - 5x3, it is equivalent to
maximizing a function Z = -7x1 - 9x2 + 5x3

Inequality in wrong direction

The sign or direction of inequality can easily be reversed
when both sides are multiplied by -1. Therefore, if the
constraint has inequality of the type ( > ), the same can
be converted into the desired inequality of the type ( < )
by multiplying both sides by -1. To illustrate consider the
inequality 2x + 5y > 18. This is equivalent to -2x - 5y < 18. But this may lead to negative value in the right side,
which makes the solution infeasible, and we may
have to adopt big M technique or two-phase technique to
find a feasible optimal solution.

Tie for the Leaving Basic

Variable (Degeneracy)

Unbounded Solutions

Non Existing Feasible Solutions

Duality is a very important concept associated with linear programming. The term
'Duality' implies that every linear programming problem, whether of maximization or
minimization, is associated with another linear programming problem based on the
same
data. The original problem in this context is called the primal problem, whereas
the
other is called its dual problem. The formulation of the dual linear
programming is
sometimes referred to as duality.