5/6/22, 5:02 PM 6.

4: Linear Programming: Simplex Method of LPP: Minimization model

TSC Online Class (NiMaVi)

6.4: Linear Programming


6.4: Linear Programming

Mark as done

 

3. Simplex Method of LPP

1. Convert subjective function with ≥ inequality (standard form)

Example 1
Find the Minimum value of the following LPP problem.

Maximize: C=4y1 + 5y2

Subject to: y1 + y2 ≥ 5, 3y1 + 5y2 ≥ 21, y1 ≥ 0, y2 ≥ 0

Solution

1. Step 0: Since all the subjective function are with ≥ inequality, Convert the LPP into Dual mode.

The dual Problem is

Find the Maximum value of the following LPP problem.

Maximize: P=5x1 + 21x2

Subject to: x1 + 3x2 ≤ 4, x1 + 5x2 ≤ 5, x1 ≥ 0, x2 ≥ 0

2. Step 1: Since all the subjective function are with ≤ inequality, Prepare a simplex Tableaux

x1 x2 y1 y2
1 3 1 0 4
1 5 0 1 5
-5 -21 0 0 0

3. Step 2: Find pivot column, pivot row and pivot element.

(a) Largest negative entry is -21, thus C2 is the pivot column.

(b) Smallest positive ratio is 1, thus R2 is the pivot row.

(c) Based on (a) and (b), 5 is the pivot element.

x1 x2 y1 y2 ratio

https://mean.edu.np/elearn/mod/book/view.php?id=296&chapterid=1969 1/3
5/6/22, 5:02 PM 6.4: Linear Programming: Simplex Method of LPP: Minimization model

1 3 1 0 4
4
= 1.3
3

1 5 0 1 5
5
⇐ 5
= 1

-5 -21 0 0 0
⇑

4. Step 3: Operating Row equivalent operation, Convert pivot element 5 to 1, and else to 0.

x1 x2 y1 y2 Operation Stage
2/5 0 1 -3/5 1 R1 ≈ R1 − 3R2 2
1/5 1 0 1/5 1 1
1
R2 ≈ R2
5

-4/5 0 0 21/5 21 R3 ≈ R3 + 21R2 3

5. Step 4: Since, negative entry in the row 3, we iterate the process to find pivot column, pivot row and pivot element.

(a) Largest negative entry is -4/5, thus C1 is the pivot column.

(b) Smallest positive ratio is 2.5, thus R1 is

(c) Based on (a) and (b), 2/5 is the pivot element.

x1 x2 y1 y2 ratio
1
2/5 0 1 -3/5 1 ⇐ 2/5
= 2.5

1
1/5 1 0 1/5 1 1/5
= 5

-4/5 0 0 21/5 21
⇑

6. Step 5: Operating Row equivalent operation, Convert pivot element 5 to 1, and else to 0.

x1 x2 y1 y2 Operation Stage
1 0 5/2 -3/2 5/2 R1 ≈
5

2
R1 1
0 1 1/2 1/2 1/2 2
1
R2 ≈ R2 − R1
5

0 0 2 3 23 3
4
R3 ≈ R3 + R1
5

7. Step 6: Since all entries in row 3 is non negative, the solution is achieved. Here, the minimum value is P=23 at
y1 = 2, y2 = 3

 

Previous activity
◄ 6.3 Sequence and Series

Next activity

Table of contents

1. Introduction
1.1. Examples
2. Graphical Method of LPP
3. Simplex Method of LPP
3.1. Simplex Method of LPP: Maximization model
3.2. Simplex Method of LPP: Minimization model

https://mean.edu.np/elearn/mod/book/view.php?id=296&chapterid=1969 2/3
5/6/22, 5:02 PM 6.4: Linear Programming: Simplex Method of LPP: Minimization model

Stay in touch
MEAN

https://mean.edu.np/

Mobile : +977 9847360402

support@mean.edu.np

https://mean.edu.np/elearn/mod/book/view.php?id=296&chapterid=1969 3/3