SYMPLEX
METHOD
INTRO
The simplex method was first
developed in 1947 by G.B. Dantzig
together with US Department of the
Airforce members. It is an iterative
technique for solving more unknown
variables that are geometrically
difficult to plot in a graph.
INTRO
In the graphical solution procedure, the
search for the optimal solution is
confined to the corner points within the
feasible area. While for the simplex
method, the search starts at the corner
where all the unknowns are in zeros and
then goes around the area from one
corner to another.
Logic of Simplex Method
Following are the steps in solving LP maximization model
using the simplex method:
Step 1. Set the LP problem by determining the unknown
variables, objective function, and constraints.
Step 2. Add the necessary slack variables. Slack variables
are variables added to constraints in order to translate
them into a linear form.
Step 3. Prepare the initial tableau.
Step 4. Assess the tableau if the solution is already
maximal. Otherwise, proceed to step 5.
Step 5. Calculate another simplex tableau: choose the pivot
columns and find the pivot row and pivot entry.
Step 6. Proceed to step 4.
The simplex method is done by iteration, which refers
to a sequence of steps or row operations in order to
move one feasible solution to another. A simplex
tableau is a table that keeps track of the calculations
for the simplex method. The right-hand-side (RHS) is at
the rightmost column of a simplex tableau that
indicates the capacities or requirements. The basic
variables are variables considered in a basic solution
The pivot column in a maximization problem should
have the lowest negative value in the last row. On
the other hand, the pivot row is a row in the
simplex tableau that contains the basic variable
that will go out of the solution. A test ratio is
conducted, which is calculated by dividing the RHS
by the IE. The intersectional elements are the
elements in the pivot column.
Lovely Enterprise manufactures two types of
slippers: rubber flip-flops and bedroom slippers.
The profitability, limitations on machine, labor, and
sales are listed below:
LP MAXIMIZATION MODEL
USING SIMPLEX METHOD
The store can only sell a maximum of 10 pairs per day of
bedroom slippers. Labor hours are limited to 30 hours of
labor a day, while the machine time has only 40 hours
daily. The owner of Lovely Enterprise wants to decide on
how many pairs of each will be produced every day in
order to achieve the highest level of profit.
For the application of simplex technique to minimization
problems, there are a few changes:
LP MINIMIZATION MODEL 1. Set the LP problem by determining the unknown
variables, objective function, and constraints.
USING SIMPLEX
2. Add the necessary slack variables. Slack variables are
variables added to constraints in order to translate them
into linear form.
3. Prepare the initial tableau. Put an asterisk in all rows
with negative elements.
4. Apply the test ratio in the first row with an asterisk.
5. Repeat step 4 until the asterisks are removed in all rows
or when the last row or objective function does not have
any negative entry (except the RHS).
Sample Problem:
Happy Chicken Co. is trying to determine the correct mix of
LP MINIMIZATION MODEL two types of chicken feeds, Brand A and Brand B, which
cost P45 and P12 per kilogram, respectively. Two essential
USING SIMPLEX ingredients are contained in the feed. Below shows the
minimum daily requirements of each ingredient:
THANKYOU
Do you have any question?
