Scribd
Upload
50 views5 pages

LPP: Simplex Method: By: Arsalan Najmi

The document summarizes the simplex method, an algebraic procedure for solving linear programming problems. It outlines the key steps of the simplex method, which include: 1) Formulating the linear programming model, 2) Adding slack variables to obtain the standard form, 3) Setting up the initial simplex tableau, 4) Choosing a non-basic variable to enter the basis using ratios, 5) Performing row operations, 6) Obtaining the new basic feasible solution, and 7) Testing for optimality and iterating if needed. The simplex method is widely used to solve large linear programs that cannot be solved graphically.

Uploaded by

Rizwan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views5 pages

LPP: Simplex Method: By: Arsalan Najmi

The document summarizes the simplex method, an algebraic procedure for solving linear programming problems. It outlines the key steps of the simplex method, which include: 1) Formulating the linear programming model, 2) Adding slack variables to obtain the standard form, 3) Setting up the initial simplex tableau, 4) Choosing a non-basic variable to enter the basis using ratios, 5) Performing row operations, 6) Obtaining the new basic feasible solution, and 7) Testing for optimality and iterating if needed. The simplex method is widely used to solve large linear programs that cannot be solved graphically.

Uploaded by

Rizwan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

LPP: SIMPLEX METHOD

BY: ARSALAN NAJMI


SIMPLEX METHOD

Previously. we showed how the graphical solution procedure can be used to solve linear
programming problems involving two decision variables. However, most linear
programming problems are too large to be solved graphically, and an algebraic solution
procedure must be employed.
The most widely used algebraic procedure for solving linear programming problems is
called the simplex method.
STEPS OF SIMPLEX METHOD

Step 1. Formulate a linear programming model of the problem.


Step 2. Add slack variables to each constraint to obtain standard form. This also provides the
tableau form necessary to identify an initial basic feasible solution for problems involving all
less-than-or-equal-to constraints with nonnegative right-hand-side values.
Step 3. Set up the initial simplex tableau.
Step 4. Choose the non basic variable with the largest entry in the net evaluation row to
bring into the basis. This variable identifies the pivot column: the column associated with the
incoming variable.
Step 5. Choose as the pivot row that row with the smallest ratio. This pivot row is the row of
the variable leaving the basis when variable j enters.
STEPS OF SIMPLEX METHOD (CONT)

Step 6. Perform the necessary elementary row operations.


a. Divide each element of the pivot row by the pivot element (the element in the pivot row and
pivot column).
b. Apply the following formula for the values to obtain the new values in the new rows.

=

Step 7. Once the row operations have been completed, the value of the new basic feasible
solution can be read from the column of the tableau.
Step 8. Test for optimality. If j= cj - zj < 0 for all columns, the solution is optimal. If not, return
to step 4.
04-March 2017
For the linear program

a. Solve the problem using the graphical solution procedure.


b. Shade in the feasible region on the graph.
c. What are the values of the slack variables at the optimal solution?
d. Range of optimality ----What if
e. Dual Price

You might also like