ADMAS University

School of postgraduate studies

Course name: Quantitative techniques for decision making

Prepared by Abraham Solomon

ID: 4477/21
Section 15

Submitted to Mebratu (Dr)

date: July 4,2022
Questions
1. Solve the following linear programming using simplex method
Maximize Z = 4X1 + 6X2
Subject to:
6X1 + 4X2 < 24
X2 < 3
5X1 + 10X2 < 40
Solution
Max Z = 4x1 + 6x2 + 0S1 + 0S2 + 0S3
Subject to
6X1 + 4X2 + S1 = 24
X2 + S2 = 3
5X1 + 10X2 + S3 = 40
And x1, x2, s1,s2,s3 > 0
Step 1:
Iteration -1 Cj 4 6 0 0 0
MinRatio
Xb
B Cb Xb X1 X2 S1 S2 S3
X2

S1 0 24 6 4 1 0 0 24/2 =6
S2 0 3 0 1 0 1 0 3/1 = 3
S3 0 40 5 10 0 0 1 40/10 = 4
Z=0 Zj 0 0 0 0 0
Zj-Cj -4 -6 0 0 0
The last Iteration Solution is
Iteration -1 Cj 4 6 0 0 0
B Cb Xb X1 X2 S1 S2 S3
S1 0 0 0 0 0.125 1 -0.15
S2 6 3 0 1 -0.125 0 0.15
S3 4 2 1 0 0.25 0 .0.1
Z=0 Zj 4 6 0.25 0 0.5
Zj-Cj 0 0 0.25 0 0.5

Since all Zj – Cj > 0

Hence, optimal solution is arrived with value of variable as:
X1 = 2, X2 = 3
Max Z = 26

Question 2
A. Using Northwest corner (NWC)
Project Location
A B C Supply
BA 72 4 76
TA 82 82
YA 16 41 77
Demand 72 102 41 235

TTC: (72*4)+ (4*8) + (24*82) + (16*16) + (16*41) = 576 + 32 + 1968 + 256+ 656 = 3488
Using LCM (least cost method)
Project Location
A B C Supply
BA 4 72 8 4 8 76
TA 16 24 82 16 82
YA 8 16 16 24 41 77
Demand 72 102 41 235

TTC: : (72*4)+ (4*8) + (24*82) + (16*16) + (16*41) = 576 + 32 + 1968 + 256+ 656 = 3488
 B. Using Vogel’s approximation methods
Project
Location
A B C Supply A B C D
BA 4 8 8 76 4 4 - -
TA 16 24 16 82 16 0 0 8
YA 8 16 24 77 5 8 8 8 8
Demand
1 4 8 8 0
2 4 8 8 -
3 8 8 8 -
4 - 8 8 -
Answer
Project Location
A B C Supply
BA 4 8 76 8 76
TA 16 24 21 16 41 82
YA 8 72 16 5 24 77
Demand 72 102 41 235

II. Optimize the initial feasible solution of the NWC method using
A. Stepping stone
Project Location
A B C Supply
BA 72 4 76
TA 82 82
YA 16 41 77
Demand 72 102 41 235
TAA = TAA – BAA+ BAA-TAB = 16-4+8-24 = 4 TAC 0 +42 = 42
BAC = BAC – YAC + YAB – BAB = 8-24-16-8= -8 TAB 82-41 = 42
BADS = BADS- YADS + YAB – BAB = 0-0+16-8 = 8 YAC = 42-41 = 0
YAA= TAC – YAC+ YAB – TAB = 8-4+8-10 = 10 YAB – 16 + 41 = 57
TAC= TAC -YAC +YAB – TAB = 16 – 24 + 16 -24 = -16
TADS= TADS + YAB- TAB = 0 – 0+16-24 = -8
 Project Location
A B C Supply
BA 72 4 76
TA 82 82
YA 16 41 77
Demand 72 102 41 235
Improved total cost : 2424
Checking optimality

BAA = BAA -BAB + YAB – YAA = 4-8+16-8 = 4

TAA = TAA- TAB +YAB – YAA = 16 -4 + 16 8 = 0
BAC= BAC-TAC+TAB-BAB = 8-16+24-8 = 8
BADS= BADS – TADS + TAB- BAB= 0-0+24-8 =16
YAC = YAC – TAC + TAB – YAB = 24-16+24-16 = 16
YADS= YADS – TADS- TAB-YAB = 0-0+24-16=8

Solution:
All the empty cell are zero and positive therefore the solution is optimal.
B. MODI
Project Location
A B C Var Supply
BA 4 72 8 4 8 0 76
TA 16 24 82 16 0 82
YA 8 16 16 24 41 20 0 77
Demand 72 102 41 20 235
Vj V1=4 V2=8 V3=8 V1=-8

U U1 + V1 = Cji U1 + V2 = C22 U U3 + V2 = C32

0 0 + V1 = 4 U2 + 14 = 24 2 U3 + 8 = 16
1 V1 = 4 U2 + 8 = 24 3 V3 = 16-8
U1 = 16 U2 = 24 -8 U3 = 8
U2 = 16
UaU1 + V2 = C12 U Aij = Cij + Ui – Vj
4 0 + V2 = 8 U U3 + V4 = C34 Jd C13 = 8 – 0-16 = -8
5- V2 = 8 6 8 + V4 = 0 C C12 – 0- 0 –( -8) = 8
7 V2 = 4 C21= 26 -16-4- = -4
C23= 16 -16-16 = -16
C24=0-16 –(-8) = -8
C31= 8-8 -4 = -4
 Project Location
A B C Var Supply
BA 4 8 44 8 0 76
TA 16 24 41 16 41 0 82
YA 8 16 57 24 20 0 77
Demand 72 102 41 20 235
Vj V1=4 V2=8 V3=8 V1=-8

U U1 + V1 = Cji U U1 + V1 = C12 U U2 + V2 = C12 U U1 + V3 = C13

8 0 + V1 = 4 13 0 + V2 = 4 12 U2 + 8 = 24 10 16 + V3 = 16
9 V1 = 4 V2 = 8 V2 = 16 11 V3 = 16-16
V3 = 0
U Aij = Cij -Vi – VJ
C13 = 8-0-0 = 8
C14 = 0-0-(-8) = 8
C21= 16-16-4 = 8
C24 = 0-16-(-8) = -8
C31 = 8-8-4 = -4
C33 = 24-8-0 = 16
14
Project Location
A B C Var Supply
BA 4 72 8 4 8 0 76
TA 16 24 22 16 41 0 82
YA 8 16 77 24 20 0 77
Demand 72 102 41 20 235
Vj V1=4 V2=8 V3=8 V1=-8

U U1 + V1 = C11 U U1 + V2 = C12 U U1 + V1 = C12 15 C13= 8-0-0 = 8

21 0 + V1 = 4 23 0 + V2 = 4 25 U2 + 8 = 24 16 C14 = 0-0-1(-16) = 16

22 V1 = 4 24 V1 = 8 26 U2 = 24-8 17 C21 = 16-16 -4 = 4

27 U2= 16 18 C31 = 8-8-4 = -4
U U2 + V2 = C12 U U2 + V4 = C24 19 C33 = 24-8-0 = 16
29 V3 + 8 = 16 16 +V4 = 0 20 C34 = 0-(-16)-8 = 8
30 V3 = 16 -8 V4 = 0-16
31 V3 = 8 V4 = -16 BAA = 72-26 = 51 BAB = 4 + 21 = 25
TAA = 0+21 = 21 TAB = 21-21 = 0
 Project Location
A B C Var Supply
BA 4 51 8 25 8 0 76
TA 16 21 24 16 20 0 82
YA 8 16 77 24 20 0 77
Demand 72 102 41 20 235
Vj V1=4 V2=8 V3=8 V1=-8

U U1 + V1 = C11 U U1 + V2 = C12 U U1 + V1 = C22 U U1 + V1 = C12

35 0 + V1 = 4 37 0 + V2 = 4 39 U2 + 4= 16 32 U2 + 8 = 24
36 V1 = 4 38 V1 = 8 40 U2 = 16-4 33 U2 = 24-8
41 U2= 12 34 U2= 16

U U2 + V3 = C23 U U3 + V2 = C32 U C13 = 8 – 0-4 = 4

44 12 + V3 = 16 U3 + 8 = 16 C14 = 0-0(-12) = 12
45 V3 = 16-12 V3 = 16-8 C22= 24-12 -8 = 4
46 V3 = 4 U3 = 8 C31= 8-8-4 = 4
C33= 24-8-4 = 12
BAA =51-51 = 0 BAB = 51 + 21 = 76
C34= 0 – (-12) – 8 = 4
YAA = 0+ 51 = 51 TAB = 77-51 = 26
42

Project Location
A B C Var Supply
BA 4 8 26 8 0 76
TA 16 21 24 16 42 20 82
YA 8 51 16 26 24 20 0 77
Demand 72 102 41 20 235
Vj V1=4 V2=8 V3=8 V1=-8

U U1 + V2 = C12 U U2 + V2 = C32 49 V3 + V1 = V31 U ij = Cij= Vi – Vj

47 0 + V2 = 8 53 V3 + 8 = 16 50 8 +V1 = 8 C1= 4-0-0 = 4
48 V1 = 8-0 54 V3 = 16 -8 51 V1 = 8 -8 C13= 8-0-0 = 8
V2 = 8 55 U3 = 8 52 V1 =0 C14= 0-0 –(-16) = 16
C22 = 24-8-6 = 10
U U = V1 = C21 U U2 + V3 = C23 U V2 + V4 = C24 C33= 24 -8 – 0 = 16
U2 = 0 + 16 16 + V1 = 16 57 16+ V4 = 0 C34= 0-8 –(-16) = 8
U2 = 16 V3 = 16-16 58 V4 = 0-16
60 V3 = 0 59 V4 = -16
All value of  ij > 0 there fore
Total Improve = (76 *8) + (21*16) + (41*16) + (20*0) + (51*8)+ (26*16)= 2424