Lecture 9 Sloving A Simplex Problem 2
Uploaded by
Chethan SrinivasLecture 9 Sloving A Simplex Problem 2
Uploaded by
Chethan SrinivasOPERATION RESEARCH
ME354
OPERATION RESEARCH
Lecture -9
Simplex Method-Example 2
NITK , Surathkal
Simplex Method -Steps
OPERATION RESEARCH
➢ Step 1: Standard Form.
➢ Step 2: Determine Slack Variables.
➢ Step 3: Setting up the Tableau.
➢ Step 4: Check Optimality.
➢ Step 5: Identify Pivot Variable.
➢ Step 6: Create the New Tableau. NITK , Surathkal
OPERATION RESEARCH Example 2
Minimize Z= 2X1- 3X2+6X3
Subject to 3X1-X2 +2X3≤ 7
2X1+4X2 ≥ -12
-4X1+3X2 +8X3≤ 10
X1 ,X2 and X3≥ 0
NITK , Surathkal
OPERATION RESEARCH Example 2
Minimize Z= 2X1- 3X2+6X3
Subject to 3X1-X2 +2X3≤ 7
-2X1 - 4X2 ≤ 12
-4X1+3X2 +8X3≤ 10
X1 ,X2 and X3≥ 0
NITK , Surathkal
OPERATION RESEARCH
Step 1&2: Standard Form/
Determine Slack Variables.
Solution
Minimize Z= 2X1- 3X2+6X3 + 0S1+ 0S2 +0S3
Subject to 3X1-X2 +2X3 + S1= 7
-2X1 - 4X2 + S2 = 12
-4X1+3X2 +8X3 + S3 = 10
X1 ,X2 , X3 S1, S2 and S3 ≥ 0 NITK , Surathkal
OPERATION RESEARCH Step 3: Setting up the Initial Tableau
Min Z= 2X1- 3X2+6X3 + 0S1+ 0S2 +0S3
Subject to 3X1-X2 +2X3 + S1= 7
-2X1 - 4X2 + S2 = 12
-4X1+3X2 +8X3 + S3 = 10
CBi Cj
Basic variable solution ratio
NITK , Surathkal
OPERATION RESEARCH Step 3: Setting up the Initial Tableau
Min Z= 2X1- 3X2+6X3 + 0S1+ 0S2 +0S3
Subject to 3X1-X2 +2X3 + S1= 7
-2X1 - 4X2 + S2 = 12
-4X1+3X2 +8X3 + S3 = 10
CBi Cj
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
S1
S2
S3
NITK , Surathkal
OPERATION RESEARCH Step 3: Setting up the Initial Tableau
Min Z= 2X1- 3X2+6X3 + 0S1+ 0S2 +0S3
Subject to 3X1-X2 +2X3 + S1= 7
-2X1 - 4X2 + S2 = 12
-4X1+3X2 +8X3 + S3 = 10
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1
0 S2
0 S3
NITK , Surathkal
OPERATION RESEARCH Step 3: Setting up the Initial Tableau
Min Z= 2X1- 3X2+6X3 + 0S1+ 0S2 +0S3
Subject to 3X1-X2 +2X3 + S1= 7
-2X1 - 4X2 + S2 = 12
-4X1+3X2 +8X3 + S3 = 10
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7
0 S2 -2 -4 0 0 1 0 12
0 S3 -4 3 8 0 0 1 10
NITK , Surathkal
OPERATION RESEARCH Initial Simplex Tableau
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7
0 S2 -2 -4 0 0 1 0 12
0 S3 -4 3 8 0 0 1 10
Zj 0 0 0 0 0 0
The green frame corresponds to ZJ:
0 X 3 + 0 X-2+ 0 X-4 =0
NITK , Surathkal
OPERATION RESEARCH Initial Simplex Tableau
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7
0 S2 -2 -4 0 0 1 0 12
0 S3 -4 3 8 0 0 1 10
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
NITK , Surathkal
OPERATION RESEARCH Step 4: Check Optimality
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7
0 S2 -2 -4 0 0 1 0 12
0 S3 -4 3 8 0 0 1 10
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
Optimality not reached NITK , Surathkal
OPERATION RESEARCH Step 5: Identify Pivot Variable
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7
0 S2 -2 -4 0 0 1 0 12
0 S3 -4 3 8 0 0 1 10
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
Key Column
Most Negative Cj-Zj Value
NITK , Surathkal
OPERATION RESEARCH Step 5: Identify Pivot Variable
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7
0 S2 -2 -4 0 0 1 0 12
0 S3 -4 3 8 0 0 1 10
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
Key Column
Most Negative Cj-Zj Value
NITK , Surathkal
OPERATION RESEARCH Step 5: Identify Pivot Variable
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
Key Column
Most Negative Cj-Zj Value
NITK , Surathkal
OPERATION RESEARCH Step 5: Identify Pivot Variable
CB Cj 2 -3 6 0 0 0
i BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0 Key Row
Least positive
Key Column
Most Negative Cj-Zj Value
NITK , Surathkal
OPERATION RESEARCH Step 5: Identify Pivot Variable
Leaving Variable Entering Variable
CB Cj 2 -3 6 0 0 0
i BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0 Key Row
Least positive
Key Column
Most Negative Cj-Zj Value Key or Pivot Element
NITK , Surathkal
OPERATION RESEARCH Step 6: Create the New Tableau.
Iteration -1
CBi Cj
Basic variable solution ratio
NITK , Surathkal
OPERATION RESEARCH Step 6: Create the New Tableau.
Iteration -1
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
0 S1
0 S2
-3 X2
Entering Variable - X2
Leaving Variable- S3
NITK , Surathkal
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
3-[-1 X -4/3]= 5/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
-1-[-1 X 1]= 0
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
2-[-1 X 8/3]= 14/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
-2-[-4 X -4/3]= -22/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
-4-[-4 X 1]= 0
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
0-[-4 X 8/3]= 32/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
Zj 4
0X5/3 + 0 X(-22/3) + (-3X-4/3) = 12/3 = 4
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
Zj 4 -3
0X0 + 0X0+ (-3X1) = -3
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj
CBi Cj 2 -3 6 0 0 0 Iteration -1
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 3 -1 2 1 0 0 7 7/-1= -7
0 S2 -2 -4 0 0 1 0 12 12/-4= -3
0 S3 -4 3 8 0 0 1 10 10/3=10/3
Zj 0 0 0 0 0 0
Cj-Zj 2 -3 6 0 0 0
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Iteration -1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Optimality not reached
Iteration -2
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3
0 S2 -22/3 0 32/3 0 1 4/3 76/3
-3 X2 -4/3 1 8/3 0 0 1/3 10/3
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Key Column
Most Negative Cj-Zj Value
Iteration -2
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Key Column
Most Negative Cj-Zj Value
Iteration -2
Key Row
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Key Column Least positive
Most Negative Cj-Zj Value
Iteration -2
Key Row
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Key Column Least positive
Most Negative Cj-Zj Value
Iteration -2
Entering Variable
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
Key Row
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
Key Column
Key Element
Leaving Variable
OPERATION RESEARCH Create the New Tableau.
Iteration -2
CBi Cj
Basic variable solution ratio
NITK , Surathkal
OPERATION RESEARCH Step 6: Create the New Tableau.
Iteration -2
CBi Cj 2 -3 6 0 0 0
Basic variable X1 X2 X3 S1 S2 S3 solution ratio
2 X1
0 S2
-3 X2
Entering Variable – X1
Leaving Variable- S1
NITK , Surathkal
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2
-3 X2
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2
-3 X2
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0
-3 X2
-22/3-[-22/3 X 1]= 0
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0
-3 X2
0-[-22/3 X 0]= 0
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5
-3 X2
32/3-[-22/3 X 14/5]= 156/5
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0
-4/3-[-4/3 X 1]=0
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1
1-[-4/3 X 0]=1
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1 32/5
8/3-[-4/3 X 14/5]=32/5
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1 32/5 4/5 0 3/5 58/5
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1 32/5 4/5 0 3/5 58/5
Zj 2 -3 -68/5 -6/5 0 -7/5 -112/5
CBi Cj 2 -3 6 0 0 0 Iteration -2
BV X1 X2 X3 S1 S2 S3 sol ratio
0 S1 5/3 0 14/3 1 0 1/3 31/3 31/3 X 3/5= 31/5
0 S2 -22/3 0 32/3 0 1 4/3 76/3 76/3 X 3/-22=-76/22
-3 X2 -4/3 1 8/3 0 0 1/3 10/3 10/3 X -3/4= -10/4
Zj 4 -3 -8 0 0 -1 -10
Cj-Zj -2 0 14 0 0 1
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1 32/5 4/5 0 3/5 58/5
Zj 2 -3 -68/5 -6/5 0 -7/5 -112/5
Cj-Zj 0 0 98/5 6/5 0 7/5
Check Optimality
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1 32/5 4/5 0 3/5 58/5
Zj 2 -3 -68/5 -6/5 0 -7/5 -112/5
Cj-Zj 0 0 98/5 6/5 0 7/5
Optimality reached
Check Optimality
CBi Cj 2 -3 6 0 0 0
BV X1 X2 X3 S1 S2 S3 solution ratio
2 X1 1 0 14/5 3/5 0 1/5 31/5
0 S2 0 0 156/5 22/5 1 14/5 354/5
-3 X2 0 1 32/5 4/5 0 3/5 58/5
Zj 2 -3 -68/5 -6/5 0 -7/5 -112/5
Cj-Zj 0 0 98/5 6/5 0 7/5
Optimum Solution = -112/5
X1 =31/5
X2= 58/5
X 3= 0
OPERATION RESEARCH
NITK , Surathkal
You might also like
- Operations Management Solutions 1 CompressNo ratings yetOperations Management Solutions 1 Compress14 pages
- Chapter 3 Linear Programming Simplex MethodNo ratings yetChapter 3 Linear Programming Simplex Method17 pages
- Lec5-Regular Simplex Method and Dual Simplex MethodNo ratings yetLec5-Regular Simplex Method and Dual Simplex Method48 pages
- Simplex Method: Example 1: Maximize Z 3x + 2xNo ratings yetSimplex Method: Example 1: Maximize Z 3x + 2x17 pages
- Chapter 3, ND Vohra Book Linear Programming II:: Simplex MethodNo ratings yetChapter 3, ND Vohra Book Linear Programming II:: Simplex Method38 pages
- Linear Programming: Simplex Method: Dr. R. K Singh Professor, Operations Management MDI, GurgaonNo ratings yetLinear Programming: Simplex Method: Dr. R. K Singh Professor, Operations Management MDI, Gurgaon58 pages
- Kuliah 11 - Optimization and Linear ProgrammingNo ratings yetKuliah 11 - Optimization and Linear Programming45 pages
- SIMPLEX METHOD - Anna University - CoimbatoreNo ratings yetSIMPLEX METHOD - Anna University - Coimbatore4 pages
- Chapter 3 The Simplex Method and Sensitivity AnalysisNo ratings yetChapter 3 The Simplex Method and Sensitivity Analysis87 pages
- Lecture 9_Introduction to Simplex MethodNo ratings yetLecture 9_Introduction to Simplex Method30 pages
- Optimization Technique Unit 21743837434024 (1)No ratings yetOptimization Technique Unit 21743837434024 (1)5 pages
- Simplex Method in Tabular Form: Construct The Initial Simplex TableauNo ratings yetSimplex Method in Tabular Form: Construct The Initial Simplex Tableau10 pages
- Conditions For Application of Simplex MethodNo ratings yetConditions For Application of Simplex Method4 pages
- 10+2 Level Mathematics For All Exams GMAT, GRE, CAT, SAT, ACT, IIT JEE, WBJEE, ISI, CMI, RMO, INMO, KVPY Etc.From Everand10+2 Level Mathematics For All Exams GMAT, GRE, CAT, SAT, ACT, IIT JEE, WBJEE, ISI, CMI, RMO, INMO, KVPY Etc.No ratings yet
- U3 Difference Between Substitution Cipher Technique and Transposition Cipher TechniqueNo ratings yetU3 Difference Between Substitution Cipher Technique and Transposition Cipher Technique3 pages
- Diseños de Regresión Discontinua FundacionesNo ratings yetDiseños de Regresión Discontinua Fundaciones57 pages
- Be - Computer Engineering - Semester 5 - 2023 - October - Data Science and Visualization DSV 2019 PatternNo ratings yetBe - Computer Engineering - Semester 5 - 2023 - October - Data Science and Visualization DSV 2019 Pattern2 pages
- Optimal Joint Detection and Estimation in Linear Models: Jianshu Chen, Yue Zhao, Andrea Goldsmith, and H. Vincent PoorNo ratings yetOptimal Joint Detection and Estimation in Linear Models: Jianshu Chen, Yue Zhao, Andrea Goldsmith, and H. Vincent Poor6 pages
- Tower of Hanoi - Algorithm Computer Science - BSCSNo ratings yetTower of Hanoi - Algorithm Computer Science - BSCS9 pages
- Uninformed Search Strategies: Artificial Intelligence COSC-3112 Ms. Humaira AnwerNo ratings yetUninformed Search Strategies: Artificial Intelligence COSC-3112 Ms. Humaira Anwer6 pages
- DDMR Trajectory Tracking With Using Pid and Kinematic Based Backstepping ControllerNo ratings yetDDMR Trajectory Tracking With Using Pid and Kinematic Based Backstepping Controller15 pages
- Mapping Precipitation in Switzerland With Ordinary and Indicator KrigingNo ratings yetMapping Precipitation in Switzerland With Ordinary and Indicator Kriging12 pages
- Examples of Continuous Probability Distributions:: The Normal and Standard NormalNo ratings yetExamples of Continuous Probability Distributions:: The Normal and Standard Normal58 pages
- Stanford University EPGY Summer Institutes 2008 Math Olympiad Problem SolvingNo ratings yetStanford University EPGY Summer Institutes 2008 Math Olympiad Problem Solving4 pages
- Shortest Path _ Mathematics for the Liberal Arts CorequisiteNo ratings yetShortest Path _ Mathematics for the Liberal Arts Corequisite13 pages
