Documente Academic
Documente Profesional
Documente Cultură
2
Roll Number:
Note: Attempt all the questions. The evaluated answer sheets can be seen on 25 May, 2018 (Friday).
1. (a) Use Big M method to solve the following linear programming problem. [8]
Maximize z = 4x1 + 3x2
subject to xi + x2 < 5, xi + 2x2 > 8, 3x1 + 2x2 > 14, xi, x2 > 0
(b) Show by inspection that the following LPP is infeasible. [4]
Minimize z = 15x subject to —x > 3, x > 5, x > 0.
Write the dual of given LPP. What can be said about the solution of the dual?
2. (a) Consider the following LPP and its given optimal table. [8]
Maximize z =2x1+ 4x2 + 3x3
subject to xi + 4x2 + 3x3 < 240,2x1 + x2 + 5x3 < 300, xi , x2, x3 > 0
B.V xi x2 x3 s1 s2 Solution
z-row 0 0 17/7 6/7 4/7 2640/7
x2 0 14 1/7 2/7 —1/7 180/7
x1 1 0 17/7 —1/7 4/7 960/7
(i) Within what range, the R.H.S. of second constraint can be varied, so that the current solution remains
feasible?
(ii) Discuss the effect of adding a non-positive variable x4 with cost 1 and column vector [2,1]T.
(b) Use Branch and Bound method to solve the following integer linear programming problem.
Maximize z =6xi + 5x2
subject to 4x1 + 5x2 < 16, 8x1 + 5x2 < 20, xi, x2 > 0 and integers. [14]
3. (a) Determine whether the given set of variables is a basic feasible solution (bfs) for a (3 x 4) order transportation
problem or not. Justify your answer. [4]
(i) (X111 X21, X22) X23 X321 X33)
(ii) (X11, X14, X21, X22, X23, X33)
(b) A product is produced by four factories A, B, C and D. The unit production costs in the four factories are
Rs. 2, Rs. 3, Rs. 1 and Rs. 5 respectively. Their production capacities are; factory A: 50 units, B: 70 units,
C: 30 units and D: 50 units. These factories supply the product to four stores, demands of which are 25, 35,
105 and 20 units respectively. Unit transportation cost in rupees from each factory to each store is given in
the table below: [15]
Stores
1 2 3 4
A 2 4 6 11
Factories B 10 8 7 5
C 13 3 9 12
D 4 6 8 3
5. In a two person game, the payoff matrix for player A is given below. [12]
Player B
6 3 —1 0 —3
Player A
3 2 —4 2 —1
(i) Solve the game graphically to find the optimal strategies of both the players and value of the game.
(ii) Which player wins the game?
(iii) Write the linear programming problem with respect to player B.