Simplex method

The graphical method can be effectively

used if there are only two variables.
However , as the number of constraints
and variables increase( 2 or more than
two) , the no of corner points on the graph
sheet would simultaneously increase. The
optimum solution lie on any corner point
and the graphical solution cannot be used
to arrive at the optimal solution.
Simplex method
George b.datzing developed an algebraic method to solve complex linear
programming problems. This method follows a series of systematic steps in
order to understand the simplex method , we need to understand the
following terms.
Slack variable : it represent the extent to which a given resource may be
left unutilized if a particular action is chosen.
Ex: if product x requires 2hrs of labour ,product y requires 3 hrs of labour
and suppose total labour hrs available are 10 we represent this constraint
as an inequality 2x+3y<=10.
If 1 unit of x and 1 unit of y are produced. Then (21) +(31)= 5 labour hrs
are used. It means that 5hrs are left unutilised.we denote the unutilized
value 5 as a slack variable s =5. always we add a slack variable to the <=
constraint.
this can be presented by converting the inequality 2x + 3y <= 10 into
equality.
i.e 2x+3y +s =10 is
Note: obj: maxmisetype , constraint: <= type, add slack variable
Surplus variable: it represent the extent to which a resource is being
used in excess of the minimum requirement.
Ex: if a sick person requires 10 units of vitamin daily for his recovery.
Fruit a contains 2 units of vitamins , and fruit b contains 3 units of
vitamins. The constraint can be represented as 2x +3y>=10. if he
consumes 3 fruits of type A and 2 fruits of type B then (23)+(3
2)=6 + 6 =12units. 2 units are more than the minimum requirement.
This can be represented in the form 2x +3y s + A=10 WHERE A
is an artificial variable
Note: obj: minimize type , constraint: >= type, subtract surplus
variable (s) and add an artificial variable A.
the purpose of artificial variable is to get an unit matrix in the initial
table of simplex method.

Basic solution: in simplex method the
solution with which the method starts is
the basic solution. It represent the point of
origin where all real values are taken at a
value of zero. Thus the initial solution
consists of slack, surplus and artificial
variables
Optimum solution: it is the best solution
available amongst all feasible solutions
which maximizes or minimizes the
objective function ex: if obj .fun is max
type ,the profit calculated after
considering the optimal solution will be
the best , compared to any profit obtained
by other feasible solutions