O[fib Cop6t-

2
Roll Number:

Thapar Institute of Engineering and Technology, Patiala

School of Mathematics
END SEMESTER EXAMINATION
B.E. (Second Year): Semester-II (2017 — 18) Course Code: UMA031
(COE/ECE/ENC) Course Name: Optimization Techniques
Date: 18/05/2018 Day/Time: Friday, 9:00 a.m.
Maximum time: 3 Hours, M. Marks: 100 Name of Faculty: AK, ID, JPR, MKS, MG, SJK, MKR

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

The aim is to minimize the total cost (production and transportation).

(i) Use Vogel's approximation method to find the initial basic feasible solution.
(ii) Determine the optimal delivery plan from each of the factories to each of the stores.
-Continue-
 (c) Determine the minimum number of hours required to complete the jobs J1, J2, J3, J4 and J5 by persons
M2, M3, M4 and M5 under the restriction that job J3 cannot be assigned to person M3. The following matrix
shows how long it takes for a specific person to finish a job. 1121
.71 J2 J3 J.4 A
M1 5 5 7 4 8
M2 6 5 8 3 7
M3 6 8 9 5 10
M4 7 6 6 3 6
M5 6 7 10 6 11
Does the given problem has alternative optimal assigni tent? If yes, find one.
4. (a) The activities in the given table describe a construction project. Draw the associated network diagram. [5]

Activity Description Immediate Predecessors

A Excavate --
B Lay the foundation A
C Put up the wall B
D Put up the roof C
E Install exterior plumbing C
F Install interior plumbing E
G Put up exterior siding D
H Do the exterior painting E,G
I Do electrical work C
J Put up the wall board F,I
K Install the flooring J
L Do interior painting J
M Install exterior fixtures H
N Install interior fixtures K,L
(b) A project consists of following activities with duration (in days) and cost (in Rupees). The indirect cost per
day is Rs. 200. [18]
Activity Normal duration Normal cost Crash duration Crash cost
(1-2) 2 1600 1 2400
(1-3) 3 1400 2 2100
(2-3) 6 2100 3 3900
(3-4) 4 1300 3 1800
(2-5) 2 1700 1 2500
(4-5) 7 1650 4 2850
(4-6) 8 1100 5 2450
(5-6) 4 2100 3 2550
(i) Use Critical Path method (CPM) to find the normal duration of completing the project and total cost
involved.
(ii) Find the most economical schedule if the project is to be completed in 19 days.

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.