Hard Copy Assignment-1 (LPP)

ME 431: Decision Modelling, SK Patel, ME, Autumn, 2020-21

Q Questions
1 A coffee industry manufactures coffee of two brands B1 & B2. One kg each of B1 & B2
consumes 3 kg and 2 kg of raw material and labour input of 1 day and 2 day respectively.
Total weekly availability of raw material and labour are 30 kg and 20 working days. The
profit earned on selling one kg of B1 & B2 are Rs 3 and Rs 4 respectively. How many kg
of B1 and B2 should be produced so as to maximize its total profit. Formulate it to a linear
programming problem.
2 Graphically solve the LPP: Maximize z = 3x1+ 4x2 subject to 3x1+ 2x2 ≤ 30, x1+ 2x2 ≤ 20
and x1, x2 ≥ 0 [Ans: z=45, x1=5, x2=15/2]
3 Graphically solve the LPP: Maximize z = 10x1+ 4x2 subject to 3x1+ 2x2 ≤ 30, x1+ 2x2 ≤
20 and x1, x2 ≥ 0 [Ans: z=100, x1=10, x2=0]
4 Using simplex method, maximize z = 2x1+ 3x2 + 4x3 subject to 2x1+ x2 + x3 ≤ 30, x1+
2x2 + x3 ≤ 20, x1+ x2 + 2x3 ≤ 30, and x1, x2, x3 ≥ 0.
[Ans: z= 190/3,x1=0,x2=10/3,x3=40/3,s1=40/3,s2=s3=0]
5 Using simplex method, maximize z = 3x1+ 4x2 subject to 3x1+ 2x2 ≤ 30, x1+ 2x2 ≤ 20 and
x1, x2 ≥ 0 [Ans: z=45, x1=5, x2=15/2]
6 Using simplex and graphical methods maximize z = 3x1+ 5x2 subject to x1 + 3x2 ≤ 9; 2x1
+ x2 ≤ 3 and x1, x2 ≥ 0 [Ans: z=15, x2=3, x1=0, and rest s1=s2=0]
7 Using simplex and graphical methods, maximize z = 2x1+ 6x2 subject to x1 + 3x2 ≤ 6, x1
+ x2 ≤ 5 and x1, x2 ≥ 0 [Ans: z = 12, x1=0, x2=2, s1=s2=0; also z = 12, x1=9/2, x2=1/2 &
s1=s2=0]
8 Using simplex and graphical methods, maximize z = 3x1+2x2 subject to 2x1 - x2 ≤ 10, x1
≤ 10 and x1, x2 ≥ 0 [Ans: Unbounded solution]
9 Using simplex and graphical methods, maximize z = 3x1+4x2 subject to x1 + x2 ≤ 5, 2x1 +
3x2 ≥ 30 and x1, x2 ≥ 0 [Ans: Infeasible solution]
10 Using Big M method of simplex, Maximize z = 3x1+ x2 Subject to 2x1 + x2 ≥ 2, 3x1 +
2x2=6, x1 + x2 ≤ 3, and x1, x2 ≥ 0 [Ans: z*= 6, x1*=2, s1*= 2, s2*= 1 & the rest
x2*=A1*=A2*=0]
11 Using Big M method of simplex, minimize z = 3x1+ x2 subject to 2x1 + x2 = 2, 3x1 + 2x2
≥ 5, x1 + x2 ≤ 3, and x1, x2 ≥ 0 [Ans: Infeasible solution]
12 Find dual of the following LPP and then find dual of dual.
Minimize z = 3x1+ 2x2 + x3 Subject to -3x1+ 3x2 + x3 ≥ 6, x1+ x2 + x3 = 3
and x1 is unrestricted in sign, x2, x3 ≥ 0
13 Find the solution of the following LPP by solving its dual with simplex method: Minimize
z = 3x1+ 2x2 + x3 subject to 3x1+ x2 + x3 ≥ 3, -3x1+ 3x2 + x3 ≥ 6, x1+ x2 + x3 ≤ 3, and
x1, x2, x3 ≥ 0 [Ans: z= 9/2, x1=0, x2=x3=3/2, s1=s2=s3=0]
Solve the above LPP by bigM method of simplex to cross check the answer.
14 Using dual simplex method: Minimize z = 3x1+ 2x2 + x3 subject to 3x1+ x2 + x3 ≥ 3, -
3x1+ 3x2 + x3 ≥ 6, x1+ x2 + x3 ≤ 3, and x1, x2, x3 ≥ 0 [Ans: z= 9/2, x1=0, x2=x3=3/2,
s1=s2=s3=0]
15 Refer Q.4. What will be the new solution if 2x1 is changed to 3x1 in the objective function?
Start from the optimal solution obtained in Q.4.
[Ans: x1=10,x2=0,x3=10, s1=s2=s3=0, z =70]
16 Refer Q.4. What will be the new solution if 3x2 is changed to 2x2 in the objective function?
Start from the optimal solution obtained in Q.4.
Dr. S.K. Patel, Mech Engg, NIT Rourkela 25-Jul-19 1 of 2
 [Ans: x1=0,x2=10/3, x3=40/3, s1=40/3, s2=s3=0, z =180/3]
17 Refer Q.4. What will be the new solution if RHS value in 2nd constraint is changed from 20
to 13? Start from the optimal solution obtained in Q.4.
[Ans: x1=0,x2=0, x3=13, s1=51/3, s2=0, s3=4, z =52]
18 Refer Q.4. What will be the new solution if the 1st term in 3rd constraint x1 is changed to -
x1? Start from the optimal solution obtained in Q.4.
[Ans: x1=10/3,x2=0, x3=50/3, s1=20/3, s2=0, s3=0, z =220/3]
19 Refer Q.4. What will be the new solution if the 2nd term in 3rd constraint x2 is changed to
2x2? Start from the optimal solution obtained in Q.4.
[Ans: x1=0,x2=0, x3=15, s1=15, s2=5, s3=0, z =60]
20 Refer Q.4. What will be the new solution if a new constraint x2+x3 ≤ 15 is added? Start from
the optimal solution obtained in Q.4.
[Ans: x1=5/2,x2=15/6, x3=75/6, s1=10, s2=0, s3=0, z =375/6]
21 Solve Q.2 using MATLAB and cross check answer.
22 Using MATLAB maximize 𝐳 = 𝟑𝒙𝟏 + 𝒙𝟐 subject to 𝟐𝒙𝟏 + 𝒙𝟐 ≥ 𝟐, 𝟑𝒙𝟏 + 𝟐𝒙𝟐 = 𝟔, 𝒙𝟏 +
𝒙𝟐 ≤ 𝟑 and 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎 [Ans: x1= 2, x2=0, z=6]
23 Refer Q.3 to 20. Solve them using MATLAB and cross check answers.

Dr. S.K. Patel, Mech Engg, NIT Rourkela 25-Jul-19 2 of 2