Hard Copy Assignment-1 (LPP)

ME 431: Decision Modelling, SK Patel, ME, Autumn, 2016-17

Note: All the following assignments are to be solved in the class note and shown in next class.
Q
1
2
3
4

Date
Questions
29-07-16 Graphically solve the LPP: Maximize z = 5x1+4x2 subject to 6x1+4x2 24,
x1+2x2 6, x1 0, x20 [Ans: z=21, x1=3, x2=3/2]
29-07-16 Graphically solve the LPP: Maximize z = 4x1+4x2 subject to 6x1+4x2 24,
x1+2x2 6, x1 0, x20 [Ans: z=21, x1=3, x2=3/2]
29-07-16 Graphically solve the LPP: Maximize z = 5x1+4x2 subject to 6x1+4x2 24,
x1+2x2 6, x2-x1 1, x2 2, x1 0, x20 [Ans: z=21, x1=3, x2=3/2]
02-08-16 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]
Using graphical and Big M methods Minimize z = 4x 1+ x2 Subject to 3x1 + x2 =
3, 4x1 + 3x2 6, x1 + 2x2 4, and x1, x2 0 [Ans : x1 = 2/5, x2 = 9/5, z = 17/5]
Using graphical and Simplex methods Maximize z = 3x1+ 9x2 Subject to x1+
4x2 8, x1 + 2x2 4, and x1, x2 0 [Ans : x1 = 0, x2 = 2, z = 18]
Using graphical and Simplex methods Maximize z = 2x1+ 4x2 Subject to x1+
2x2 5, x1 + x2 4, and x1, x2 0 [Ans:x2= 5/2,s2=3/2,z=10;or x1=3,x2=1,z= 10;]
Using graphical and Simplex methods Maximize z = 2x 1+x2 Subject to x1 - x2
10, 2x1 40 and x1, x2 0 [Ans : Unbounded solution in x2 direction, z = ]
Using graphical and Simplex methods Maximize z = 3x1+2x2 Subject to 2x1 + x2
2, 3x1 + 4x2 12, and x1, x2 0 [Ans : Infeasible solution]
Show that dual of dual is primal taking the following LPP as an example:
Minimize z = 3x1+ 2x2 + x3 subject to -3x1+ 3x2 + x3 6, x1+ x2 + x3 = 3,
and x1, x2, x3 0
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 = 3/2, x3 = 3/2, s1 = s2 = s3 = 0]
Refer Q.10. Find its dual. Solve this dual LPP by simplex method and from its
final table write down the solution of LPP mentioned in Q.10.
Refer Q.3. What will be the new solution if 2x1 is changed to 3x1 in the
objective function? Start from the optimal solution obtained in Q.3.
[Ans: x1=10,x2=0,x3=10, s1=s2=s3=0, z =70]
Refer Q.3. What will be the new solution if 3x2 is changed to 2x2 in the
objective function? Start from the optimal solution obtained in Q.3.
[Ans: x1=0,x2=10/3, x3=40/3, s1=40/3, s2=s3=0, z =180/3]
Refer Q.3. 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.3.
[Ans: x1=0,x2=0, x3=13, s1=51/3, s2=0, s3=4, z =52]
Refer Q.3. 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.3.
[Ans: x1=10/3,x2=0, x3=50/3, s1=20/3, s2=0, s3=0, z =220/3]
Refer Q.3. 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.3.
[Ans: x1=0,x2=0, x3=15, s1=15, s2=5, s3=0, z =60]
Refer Q.3. What will be the new solution if a new constraint x2+x3 15 is
added? Start from the optimal solution obtained in Q.3.
[Ans: x1=5/2,x2=15/6, x3=75/6, s1=10, s2=0, s3=0, z =375/6]

Dr. S.K. Patel, Mech Engg, NIT Rourkela

4-Sep-15

Page 1 of 1