The Simplex Method

Can be used to solve LP models when there are any number of variables.
It begins with a feasible point and then tests if the value of the objective function
is optimal. If not, it moves to a better solution.
The generation of a solution requires solving a system of linear equations. The
search continues until no improvement in the solution is possible i.e when we
have reached the optimal solution.

REQUIREMENTS OF THE SIMPLEX METHOD
All constraints must be stated as equations
The right hand side of a constraint cannot be negative.
All variables are restiricted to nonnegative values.

For add a slack variable on the left hand side to convert it to an
equation.
We have more variables than equations.
A Basic Solution is one in which we assign the value zero to some variables and
then solve for the remaining variables.
Nonbasic variables are the ones which have been assigned the value zero.
Basic variables are the ones computed by solving the system of equations.
A basic feasible solution is one which satisfies the nonnegativity constraint also.

By the corner point method we get ,
The plot below shows the feasible region in yellow



>

Restating the problem in terms of equations;

Optimal value occurs at a corner point. At these points, at least two of the four
variables are zero.
Also, if any two of the four variables are zero, we get a corner point. The simplex
method starts with the corner point (0,0) and moves to another corner point
which gives a better solution.
Check: At every corner point any two of the four variables are zero.
Corner Point Solution
A(0,0)

B(4,0)

C(3,2)

D(0,4)

Initial Simplex Table

[(

)]

Select the varaiable with the most negative coefficient in the objective function
row as the entering variable. This will add the greatest possible per unit profit.
Find the ratios by dividing entries of R by the corresponding entries of the pivot
column.
Leaving variabl e is the one with the smallest ratio. (Else one of the constraints
will be violated).
So

Convert the pivot element to 1 by using EROs and all other entries in the pivot
column ore zero. Read off the new solution.
Converting all other entries in column 1 to zero by using

[(

)]


The iterative process continues till all indicators in the last row are nonnegative.

It is not possible for us to improve upon the BFS. No negative indicators means we
have an optimal solution,. The optimal solution is

Max value of z = 12