Reg. No.

Question Paper Code : 13519

B.E. / B. TECH DEGREE EXAMINATION, NOVEMBER / DECEMBER 2017
Fifth Semester
Open Elective
15UMP01 – OPTIMIZATION TECHNIQUES
(Regulations: Mepco – R2015)
(Use of normal tables is permitted)
Duration: 3 Hours Max.: 100 Marks
Answer ALL Questions
PART A – (10  2 = 20 Marks)
R 1. State the assumptions made in sequencing.
U 2. Give any two different examples of sequencing problem from your daily life.
U 3. What is EVPI and EPPI?
R 4. What do you understand by a “roll back process” in decision tree analysis?

R 5. Write down the major difference between zero – sum and nonzero – sum games.
U 6. For what value of  , the game with following payoff matrix is strictly determinable?
Player B
I II III
Player A I  6 2
II -1  -7
III -2 4 
R 7. List the applications of max – flow problem.
U 8. Distinguish between CPM and PERT.
U 9. Explain Bellman’s principle of optimality to solve dynamic programming problem.
R 10. State the Kuhn – Tucker conditions to maximize the non – linear programming problem.

PART B – (5  16 = 80 Marks)
U 11. a) i. The information regarding jobs to be scheduled through one machine is
given below.
Job: A B C D E F G
Processing time (days): 4 12 2 11 10 3 6
Due date (days): 20 30 15 16 18 5 9

1
13519
 A) What is the shortest processing time schedule?
B) What is the slack time remaining schedule?
C) What is the earliest due date schedule?
D) What is the mean flow time in any one of the above schedule? (8 Marks)
A 11. a) ii. There are seven jobs, each of which has to go through the machines A and
B in the order AB. Processing timings in hours are given as
Job: 1 2 3 4 5 6 7
Machine A: 3 12 15 6 10 11 9

Machine B: 8 10 10 6 12 1 3
Determine a sequence of these jobs that will minimize the total elapsed
time. Also find the total elapsed time, idle time for machines A and B. (8 Marks)
OR
U 11. b) i. Use graphical method to minimize the time required to process the
following jobs on the machines. For each machine specify the job which
should be done first. Also calculate the total elapsed time to complete both
the jobs.
 Sequence A B C D E
Job 1 
Time (hr.) 6 8 4 12 4
 Sequence BA CC B
A D EF
D
Job 2 
Time (hr.) 10 8 6 4 12
(8 Marks)
A 11. b) ii. Four jobs A, B, C and D are to be processed on four machines M1, M 2 ,

M 3 and M 4 in the order M1M 2 M 3M 4 . The corresponding processing time

(in hours) is given below:
Machines : M1 M2 M3 M4
Job A : 20 10 9 20
Job B : 17 7 15 17
Job C : 21 8 10 21
Job D : 25 5 9 25

Determine a sequence of these four jobs that minimizes the total elapsed
time. Also find the total elapsed time to finish all the jobs and the idle time
for each machine. (8 Marks)

U 12. a) i. Explain the following terms: (A) Laplace criterion (B) Hurwicz criterion
(C) Minimax Regret/Savage criterion (6 Marks)

2
13519
L 12. a) ii. A newspaper boy has the following probabilities of selling a magazine;

Number of copies sold : 10 11 12 13 14

Probability : 0.10 0.15 0.20 0.25 0.30

Cost of a copy is 3 rupees and sale price is 5 rupees. He cannot return

unsold copies. How many copies should he order? (10 Marks)
OR
(U) 12. b) i. Explain the construction of a decision tree. What do you mean by it? (6 Marks)

L 12. b) ii. Mr. Modi had to decide whether or not to drill a well on his farm. In his
village, only 40% of the wells drilled were successful at 200 feet of depth.
Some of the farmers, who did not get water at 200 feet, drilled further upto
250 feet but only 20% struck water at 250 feet. Cost of drilling is Rs. 50 per
foot. Mr. Modi estimated that he would pay Rs. 18,000 during a 5 – year
period in the present value terms, if he continues to buy water from the
neighbour rather than go for the well which would have a life of 5 years.
Mr. Modi has three decisions to make:
A) Should he drill upto 200 feet?
B) If no water is found at 200 feet, should he drill upto 250 feet?
C) Should he continue to buy water from his neighbour? (10 Marks)

A 13. a) i. Reduce the following game by dominance property and find the game
value:
Player B
I II III
Player A I 1 7 2
II 6 2 7
III 6 1 6
(8 Marks)
A 13. a) ii. Solve the 2 x 5 game by graphical method:
Player B
1 2 3 4 5
Player A
1 -5 5 0 -1 8
2 8 -4 -1 6 -5 (8 Marks)
OR
3
13519
A 13. b) i. A and B play a game in which each has three coins a 5p, a 10p and a 20p.
Each player selects a coin without the knowledge of the other’s choice. If
the sum of the coins is an odd amount, A wins B’s coin, if the sum is even,
B wins A’s coin. Find the best strategy for each player and the value of the
game.
(8 Marks)
A 13. b) ii. Solve the following game by using oddments matrix method:
Player B
1 -1 -1
Player A -1 -1 3
-1 2 -1 (8 Marks)

A 14. a) i. Find the minimal spanning tree for the following network:
B 2 C
2 4 3 1
2
A D 4 E H
3 5
1 6
6
F G
(6 Marks)
A 14. a) ii. Three time estimates (in days) of all activities of a project are as given
below:
Activity 1 – 2 1 – 3 1 – 4 2 – 5 3 – 5 4 – 6 5 – 6
a 5 1 2 3 1 2 1
m 5 1 4 6 1 2 4
b 7 7 12 15 1 8 7
What is the probability that the project will be completed (A) at least 5 days
earlier than expected and (B) on or before 22 days expected? (10 Marks)
OR

4
13519
A 14. b) A maintenance foreman has given the following estimate of time and cost
of jobs in a project:
Normal Crash
Jobs Predecessor
Time (hrs) Cost (Rs.) Time (hrs) Cost (Rs.)
A - 8 80 6 100
B A 7 40 4 94
C A 12 100 5 184
D A 9 70 5 102
E B,C,D 6 50 6 50
If the overhead cost is Rs. 25/hours, find the least cost schedule and
minimum duration. (16 Marks)
n
A 15. a) Use Dynamic programming to solve M in. Z   yi 2 subject to
i 1
n
 yi  b where yi  0 , for i  1, 2,..., n .
i 1 (16 Marks)
OR
A 15. b) i. Determine the relative maximum and minimum (if any) of the following

function: f ( x)  x1  2x3  x2 x3  x12  x2 2  x32 . (8 Marks)

A 15. b) ii. Solve the nonlinear programming by Lagrangian multiplier method

Max. Z  4x12  2x22  x32  4x1x2 subject to x1  x2  x3  15 ,

2x1  x2  2x3  20 and x1 , x2 , x3  0 . (8 Marks)

5
13519
6
13519