Assignment Problems- I : Operations Research ( MA30014)

Spring Semester, 2017, Dept. of Mathematics, IIT- Kharagpur

Solve the following LP Problems using the following methods which is applicable:
(a) Basic feasible solution method,
(b) Graphical method ( only for two variable problem)
(c) Simplex Method ( involving only Type I inequations )
(d) Charnes Penalty Method ( Big M Method ) involving artificial variables
(e) Two Phase Simplex Method involving artificial variables
(f) Primal Simplex Method involving Type I inequations
(g) Dual Simplex Method involving Type II inequations
(h) Primal Dual Simplex Method involving both Type I & Type II in equations
(i) Revised Simplex Method for all types of LPP
(j) Interior Point Method ( IPM ) for all types of LPP
(k) Any other method you know if it is applicable.

No1. Max: Z= 5 x1 + 3 x 2
Subject to
3x1 + 5 x 2 15
5 x1 + 2 x 2 10
x1 , x 2 0

No.2 Max: Z= 5 x1 + 7 x 2
Subject to
x1 + x 2 14
3 x1 + 8 x 2 24
5 x1 + 7 x 2 35
x1 , x 2 0

No.3 Max: Z= x1 + x 2
Subject to
6 x1 + 5 x 2 1
2 x1 + 9 x 2 1
7 x1 + 3 x 2 1
x1 , x 2 0

No.4 Max: Z= x1 + x 2 + x3
Subject to
3 x1 2 x 2 + 4 x3 1
x1 + 4 x 2 + 2 x3 1
2 x1 + 2 x 2 + 6 x3 1
x1 , x 2 , x3 0
No.5 max : R = x + y + z
x y + 3z 1
3x + 5 y 3z 1
Subject to
6x + 2 y 2z 1
x, y , z 0
3 5 3
Is ( , , ) this point an optimal solution of the LPP ?
16 16 8

No.6 Max: Z= 3 x1 + 4 x 2
Subject to
x1 + 2 x 2 8
9 x1 + 2 x 2 14
3 x1 + 10 x 2 30
x1 , x 2 0
No.7 Min: Z= x1 + x 2 + x3
Subject to
5 x1 + 7 x 2 + 10 x3 1
3 x1 + 9 x 2 + 6 x3 1
7 x1 + x 2 + 2 x3 1
x1 , x 2 , x3 0
No.8 Min: Z= 7 x1 + 3 x 2 + 8 x3
Subject to
8 x1 + 2 x 2 + x3 3
3 x1 + 6 x 2 + 4 x3 4
x1 , x 2 , x3 0
No.9 Min: Z= x1 x 2 x3
Subject to
x1 + 2 x 2 + x3 + x 4 = 4
x1 + x 2 + 2 x3 + x5 = 2
x1 , x 2 , x3 , x 4 , x5 0

No.10 Max: Z= x1 + x 2 + x3
Subject to
x1 + x 2 x3 1
x 2 + x3 1
2 x1 + 2 x 2 2
x1 , x 2 , x3 0
No.11 Max: Z= x1 + x 2 + x3
Subject to
6 x1 + 8 x 2 + 6 x3 1
4 x1 + 12 x 2 + 2 x3 1
x1 , x 2 , x3 0
No.12 Max: Z= x1 + x 2
Subject to
x1 + x 2 10
x1 + 2 x 2 12
x1 + 4 x 2 20
x1 , x 2 0
No.13 Min: Z= x1 + 4x 2
Subject to
x1 + 2 x 2 8
x1 + 4 x 2 10
x1 , x 2 0

Express the given problem into a Linear Programming format by suitable

Transformation.
No.14 Maximize: Z= Min{| x1 x 2 + 3 x3 |, | x1 + 3 x 2 x3 |}
Subject to
5 x1 + 7 x 2 + 10 x3 1
3 x1 + 9 x 2 + 6 x3 1
7 x1 + x 2 + 2 x3 1
x1 , x 2 , x3 0
No.15 Max: Z= 7 x1 + 3 x 2
Subject to
6 x1 + 5 x 2 10
2 x1 + 9 x 2 10
7 x1 + 3 x 2 10
x1 0 and x 2 is unrestricted in sign.

No.16 Max: Z= 2 x1 + 3 x 2 + 4 x3
Subject to
x1 + 2 x 2 + x3 = 40
x1 + x 2 + 2 x3 = 30
x1 , x 2 , x3 are unrestricted in sign.
No. 17 State all the LPP (No.1-16) which has alternate optimal solutions.
No.18 State all the LPP(No.1-16) those are unbounded or infeasible.
No.19 Find the Dual of all the Linear Programming Problems( No. 1-No16)
No. 20 Solve all the Dual LPP formulated in Problem No. 19.