Reg. No.

Question Paper Code : 14031

B.E. / B.TECH DEGREE EXAMINATION, APRIL / MAY 2018

Sixth Semester
Open Elective
15UMP01 – OPTIMIZATION TECHNIQUES
(Regulations: Mepco – R2015)
(Use of normal tables are permitted)
Duration: 3 Hours Maximum Marks:100
Max. : 100 Marks
Answer ALL Questions
Cog. PART A – (10  2 = 20 Marks)
R, CO1 1. List the various methods to solve the sequencing problems for processing n
jobs through one machine.
U, CO1 2. Find the optimal sequence to complete the following jobs on two machines:
Job: 1 2 3 4 5 6 7 8 9
Machine A: 6 8 7 5 4 2 5 4 9
Machine B: 3 9 3 8 11 6 8 7 4
U, CO2 3. What is meant by courses of action and states of nature in decision making
analysis?
R, CO2 4. Define “foldback process” in decision tree analysis.
R, CO3 5. Define Saddle point.
U, CO3 6. When a given game is fair or strictly determinable?
R, CO4 7. State max flow –min cut theorem.
U, CO4 8. What are the floats involved in network scheduling?
U, CO5 9. Explain states and stages in dynamic programming.
U, CO5 10. What are the necessary conditions to solve the unconstrained optimization
problem?

1
14031
 PART B – (5  16 = 80 Marks)
U, CO1 11. a) i. Six jobs A, B, C, D, E and F have arrived at one time to be
processed on a single machine.
Job: A B C D E F
Processing time:(minutes) 9 4 8 3 2 6
Assume that no new jobs arrive thereafter, determine
A) Optimal sequence as per SPT rule
B) Completion time of the jobs
C) Mean flow time
(8 Marks)
D) Average in-process inventory.
A, CO1 11. a) ii. Find the sequence that minimizes the total elapsed time
required to complete the following tasks on two machines.
Also find total elapsed time and idle time.
Task: A B C D E F G H I
Machine I: 2 5 4 9 6 8 7 5 4
(8 Marks)
Machine II: 6 8 7 4 3 9 3 8 11
OR
U, CO1 11. b) i. A machine shop has 4 machines A, B, C and D. Two jobs
must be processed through each of these machines. The time
(in hrs.) taken on each of the machines and the necessary
sequence of jobs through the shop are given below.
Sequence A B C D
Job 1
Time 2 4 5 1
Sequence D B A C
Job 2
Time 6 4 2 3
Use graphical method to obtain the total minimum elapsed
(8 Marks)
time.
A, CO1 11. b) ii. There are five jobs, each of which is to be processed through
three machines A, B and C in the order ABC. Processing
times in hours are
Job: 1 2 3 4 5
Machine A: 3 8 7 5 4
Machine B: 4 5 1 2 3
Machine C: 7 9 5 6 10
Find the sequence that minimizes the total elapsed time and
(8 Marks)
idle time for each machine.

2
14031
U, CO2 12. a) i. Construct a decision tree for the following decision making
problems:
Alternative (Profit)
State of Nature Prob. P (Produce Q (Produce
25 units) 75 units)
High Demand 0.6 Rs. 4000 Rs. 10000
Low Demand 0.4 Rs. 2000 Rs. -5000 (4 Marks)

L, CO2 12. a) ii. A businessman has three alternatives open to him each of
which can be followed by any of the four possible events.
The conditional payoffs (in thousands of rupees) for each
action- event combination are given below:
Payoffs conditional on events
Alternative
A B C D
X 8 0 -10 6
Y -4 12 18 2
Z 14 6 0 8

Determine which alternative should the businessman choose,

if he adopts the (A) Maximin principle, (B) Minimax Regret
criterion and (C)Hurwicz criterion with coefficient of
(12 Marks)
optimism 0.6 are followed.
OR
U, CO2 12. b) i. Discuss Laplace criterion to make the decision by the decision
(4 Marks)
maker.
L, CO2 12. b) ii. A client asks an estate agent to sell three properties A, B and
C for him and agrees to pay him 5% commission on each sale.
He specifies certain conditions. The estate agent must sell
property A first, and this he must do within 60 days. If and
when A is sold, the agent receives his 5% commission on that
sale. He can then either back out at this stage or nominate and
try to sell one of the remaining two properties within 60 days.
If he does not succeed in selling the nominated property in
that period, he is not given the opportunity to sell the other. If
he does not sell it in the period he is given the opportunity to
sell the third property on the same conditions. The following

3
14031
 table summarizes the prices, selling costs and the estate
agent’s estimated probability of making a sale.
Prices of Selling Cost
Probability
Property Property
of sale
(Rs.) (Rs.)
A 12,000 400 0.7
B 25,000 225 0.6
C 50,000 450 0.5
A) Draw up an appropriate decision tree for the estate agent.
B) What is the estate agent’s best strategy under EMV
approach? (12 Marks)

L, CO3 13. a) i. Solve the following game by graphical method:

Player B
6 4 3
Player A (8 Marks)
2 4 8
A, CO3 13. a) ii. Reduce the following game by dominance and find the game
value:
Player B
I II III IV
I 3 2 4 0
II 3 4 2 4
Player A
III 4 2 4 0
(8 Marks)
IV 0 4 0 8
OR
L, CO3 13. b) i. In a game of matching coins, player A wins Rs. 2 if there are
two heads, wins nothing if there are two tails and losses Re.1
when there are one head and one tail. Determine the payoff
matrix, best strategies for each player and the value of game
(8 Marks)
to A.
A, CO3 13. b) ii. Solve the following game by using oddments matrix method:
Player B
I II III
Player A I -1 2 1
II 1 -2 2
(8 Marks)
III 3 4 -3

4
14031
A, CO4 14. a) i. Find the minimal spanning tree for the graph whose distance
matrix is given below:
A  1 4  2 
B  1   3 3 
C 4   1 3
 
D  3 1  2 
E  2 3 3 2   (6 Marks)

A, CO4 14. a) ii. The list of activities and the associated times in days of a
project are given below:

Task A B C D E F G

Predecessor - - A A B C D, E
tp 10 4 3 14 12 5 7
tm 3 3 2 6 5 4 1
to 2 2 1 4 4 3 1
A) Construct the network diagram
B) Find the critical path and variance of each activity
C) What is the probability that the project will be completed
(10 Marks)
in 16 days?
OR
A, CO4 14. b) The following time-cost table (time in weeks, cost in rupees)
applies to a project. Use it to arrive the network associated
with completing the project in minimum time and its
corresponding total cost.
Normal Crash
Activity
Time Cost Time Cost
1–2 2 800 1 1400
1–3 5 1000 2 2000
1–4 5 1000 3 1800
2–4 1 500 1 500
2–5 5 1500 3 2100
3–4 4 2000 3 3000
3–5 6 1200 4 1600
(16 Marks)
4–5 3 900 2 1600

5
14031
A, CO5 15. a) Use Dynamic programming to solve
Max. ,
subject to
(16 Marks)
and , for .
OR
A, CO5 15. b) i. Solve the following non-linear programming problem:
Optimize ,
(8 Marks)
subject to: and .
A, CO5 15. b) ii. Solve the following non-linear programming problem by
Kuhn-Tucker conditions:
Maximize ,
(8 Marks)
Subject to and .

6
14031