Operations Research Assignment 2

Gaurav Suraywanshi 16MA20018 11 t h February 2019

Q1)
ans
Equations
x 1+ 2 x 2−2 x 3 ≤ 30x 1+ 3 x 2 + x 3 ≤ 36x 1 , x 2 , x 3 ≥ 0

Introducing Slack Variables s1 , s 2

x 1+ 2 x 2−2 x 3+ s 1=30x 1+ 3 x 2 + x 3 +s 2=36x 1 , x 2 , x 3 ≥ 0

1) Taking x 1 , x 2∧x 3 as 0

x1 x2 x3 s1 s2 Y
0 0 0 1 0 30
0 0 0 0 1 36

⇒ x 1=0 ; x 2=0 ; x 3=0 s1=30 ; s2=36

Basic Feasible Solution

2) Taking x 1 , x 2∧s1 as 0

x1 x2 x3 s1 s2 Y
0 0 −2 0 0 30
0 0 1 0 1 36

⇒ x 1=0 ; x 2=0 ; x 3=−15

s1=0; s 2=51

Basic Solution
3) Taking x 1 , x 2∧s2 as 0

x1 x2 x3 s1 s2 Y
0 0 −2 1 0 30
0 0 1 0 0 36

⇒ x 1=0 ; x 2=0 ; x 3=36

s1=102 ; s2=0

Basic Feasible Solution

4) Taking x 1 , x 3∧s2 as 0

x1 x2 x3 s1 s2 Y
0 2 0 1 0 30
0 3 0 0 0 36

⇒ x 1=0 ; x 2=12 ; x 3=0

s1=6 ; s 2=0

Basic Feasible Solution

5) Taking x 1 , x 3∧s1 as 0

x1 x2 x3 s1 s2 Y
0 2 0 0 0 30
0 3 0 0 1 36

⇒ x 1=0 ; x 2=15 ; x 3=0

s1=0; s 2=−9

Basic Solution
6) Taking x 2 , x 3∧s1 as 0

x1 x2 x3 s1 s2 Y
1 0 0 0 0 30
1 0 0 0 1 36

⇒ x 1=30 ; x 2=0 ; x 3=0

s1=0; s 2=6

Basic Feasible Solution

7) Taking x 2 , x 3∧s2 as 0

x1 x2 x3 s1 s2 Y
1 0 0 1 0 30
1 0 0 0 0 36

⇒ x 1=36 ; x 2=0 ; x 3=0

s1=−6 ; s 2=0

Basic Feasible Solution

8) Taking x 3 , s1∧s 2 as 0

x1 x2 x3 s1 s2 Y
1 2 0 0 0 30
1 3 0 0 0 36

⇒ x 1=18 ; x 2=6 ; x 3=0

s1=0; s 2=0

Basic Feasible Solution

9) Taking x 2 , s1∧s 2 as 0

x1 x2 x3 s1 s2 Y
1 0 −2 0 0 30
1 0 1 0 0 36

⇒ x 1=34 ; x 2=0; x 3=2

s1=0; s 2=0

Basic Feasible Solution

10) Taking x 1 , s1∧s 2 as 0

x1 x2 x3 s1 s2 Y
0 2 −2 0 0 30
0 3 1 0 0 36

⇒ x 1=0 ; x 2=12.75 ; x 3=−2.25

s1=0; s 2=0

Basic Solution
Maximising the values

Maximize z=5 x 1 +2 x 2 +2 x 3

x1 x2 x3 Z
0 0 0 0
0 0 36 72
0 12 0 24
30 0 0 150
36 0 0 180
18 6 0 102
34 0 2 174
 Thus maximum value is 180 and occurs at (36 , 0 , 0)

Q2)
Ans

Minimize z=−3 x 1+ 2 x 2Subject to

x 1−4 x2 ≤−14−3 x 1+ 2 x 2 ≤ 6x 1 , x 2 ≥ 0

Initial Simplex Tableau,

−x 1 −x 2 1
z1 1 −4 −14
z2 −3 2 6
Z 3 −2 0

Min Ratio
Exchanging x 2∧z 2, Dividing the x 2 row by 2, Dividing the column by -2, and other elements by
ps−qr
s= we get
p
−x 1 −z 2 1
z1 1∗2−4∗3 −4 −14∗2+4∗6
=−5 =2 =−2
2 −2 2
x2 −3 1 6
=3
2 2 2
Z 3∗2−3∗2 −2 0∗2+ 2∗6
=0 =1 =6
2 −2 2
As All Ratios in the IR is positive Maximum is 6

Q4)
Ans

Minimize z=5 x 1+ 2 x 2Subject to

6 x 1+ 10 x 2 ≤3010 x 1+ 4 x 2 ≤ 20x 1 , x 2 ≥ 0

Initial Simplex Tableau,

−x 1 −x 2 1
z1 6 10 30
z2 10 4 20
Z −5 −2 0
Min Ratio
 Exchanging x 1∧z 2, Dividing the x 1 row by 10, Dividing the column by -, and other elements by
ps−qr
s= we get
p
−z 2 −x 2 1
z1 −6 10∗10−6∗4 ¿ 30∗10−20∗6
=−0.6 =7.6 =18
10 10 10
x1 1 4 20
=0.4 =2
10 10 10
Z 5 (−20+20 ) ¿ 100
=0.5 =0 0∗10+ =10
10 10 10
As values corresponding to the non-basic variable x 2 is 0.
⇒ More than one optimal Solution
One more iteration

−z 2 −x 2 1
z1 −0.6 10 18
=−0.078 =2.368
7.6 76 7.6
x1 1 4 20
=0.4 =2
10 10 10
Z 5 (−20+20 ) 100
=0.5 =0 0∗10+ =10
10 10 10

Q5)
Ans

Minimize z=2 x 2+ x 3 Subject to

x 1+ x2 −2 x 3 ≤7−3 x 1+ x 2 +2 x 3 ≤ 3x 1 , x 2 , x 3 ≥ 0

Initial Simplex Tableau,

−x 1 −x 2 −x 3 1
z1 1 1 −2 7
z2 −3 1 2 3
Z 0 −2 −1 0
Min Ratio
Exchanging x 1∧z 2, Dividing the x 1 row by 10, Dividing the column by -, and other elements by
ps−qr
s= we get
p
−z 2 −x 2 1
z1 −6 10∗10−6∗4 30∗10−20∗6
=−0.6 =7.6 =18
10 10 10
x1 1 4 20
=0.4 =2
10 10 10
Z 5 (−20+20 ) 100
=0.5 =0 0∗10+ =10
10 10 10
As values corresponding to the non-basic variable x 2 is 0.
⇒ More than one optimal Solution