Scribd
Upload
49 views

Simplex Method

The document provides an overview of using the simplex method to solve linear programming problems (LPP). It explains the steps to convert an LPP into standard form and construct the initial tableau. The key steps are to rewrite inequalities as equations, create the objective row with negatives of coefficients, and find the pivot column and row to create new tableaus. Two examples applying these steps to solve LPPs are provided.

Uploaded by

Rwagatare civilcontractors
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Simplex Method

The document provides an overview of using the simplex method to solve linear programming problems (LPP). It explains the steps to convert an LPP into standard form and construct the initial tableau. The key steps are to rewrite inequalities as equations, create the objective row with negatives of coefficients, and find the pivot column and row to create new tableaus. Two examples applying these steps to solve LPPs are provided.

Uploaded by

Rwagatare civilcontractors
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Module: Mathematics for Engineers IV (Year 2: CSE, SGE, EPE and

ETE).
Academic year 2020-2021
Prepared by Mr. Jean Paul Nsabimana
Email: [email protected]/[email protected]
Date: 28th December, 2020

Chapter 5: Optimization (LPP)


Resolution of the Linear Programming Problems (LPP)
Simplex Method to solve LPP

Before Simplex algorithm can be used to solve an LP, the LP must be


converted, into equivalent problem in which all constraints are equalities and all
variables are non-negative. An LP in this form is said to be in standard form.

Step1: Rewrite each constraint (inequality) as an equation.

Step2: Write the revised problem as a tableau, with the objective row
(= bottom row) consisting of negatives of the coefficients of the objective
function Z; Z will be maximized. The lower right corner is the value of Z when
x, y,... are zero ; thus, Z usually starts out as zero.
Step 3: The pivot column is that column containing the most negative
indicator. If no indicator negative the tableau is a FINAL TABLEAU.

Step 4: Form RATIOS (quotients) for each row: divide the right-most number
by the number in the pivot column of that row.

Step 5: The PIVOT ROW is the row with the smallest NON-NEGATIVE
ratio (quotient). Note that (+1) and (-1) are both numerically zero, but
in Calculating RATIOS, consider (+1) as positive (OK), and (-1) as
negative (not OK).
Step 6: Apply a pivot operation to the tableau, including the bottom (objective)
row. The pivot column will become a column of a new ISM in the new tableau.
Note which column is replaced, and where the new ISM is located; its columns
may not be in the usual order: not to worry. Check out the PIVOT ENGINE to
speed up practice.
step 7: (optional) Note the new basic solution (corner point) for the new
tableau.
Example 1: Solve the following LPP using simplex Method

Subject to

Solution: We need to write the given LPP into Standard form by adding the slack
variables to inequality constraints to obtain equality constraints . Then we get

Subject to

The Initial Table : The first column is Pivot Column since it contains the most negative
indicator and the second row is the Pivot Row since it contains smallest non-negative
number. Pivot value is 3.
Basic RHS Ratio

1 2 1 0 40 R1

2 0 1 60 R2
3

-Z -15 0 0 0
New Table: Enters into the basic variables and leaves from the basic variables

Basic RHS Ratio

0 1 20

1 0 20 30
-Z 0 400

Here, Second column is the pivot column and the first row is the pivot row.
The pivot value is 4/3. The next tableau is constructed as follows:

Tableau : Entering into the basic variables and leaves from the basic
variables

Basic RHS Ratio

0 1

1 0 10

425

This is the final table since the values in the last row are greater or equal to zero.

Therefore, with .
Example 2: Solve the following LPP using simplex Method

Subject to

Solution: In the standard form we have,

Subject to

The initial tableau


Basic RHS Ratio

1 2 1 0 0 16

1 1 0 1 0 9

3 2 0 0 1 24

-Z -40 -30 0 0 0 0

The first column is Pivot Column since it contains the most negative indicator and the third
row is the Pivot Row since it contains smallest non-negative number. The pivot is 3.
New Tableau: Entering while leaving the basic variables.

Basic RHS Ratio

0 1 0 8

0 0 1 1

1 0 0 8

-Z 320
The second column is Pivot Column since it contains the most negative indicator and the
second row is the Pivot Row since it contains smallest non-negative number. The pivot is .

New Tableau: Entering while leaving the basic variables.

Basic RHS Ratio

0 0 1 -4 4

0 1 0 3 3

1 0 -2 1 6

-Z 330

This is the FINAL TABLEAU. Therefore, =6 , =3 with .

Exercise:

Subject to

2.
Subject to

You might also like