Reg. No.

Question Paper Code : 15182

B.E. / B.TECH. DEGREE EXAMINATION, APRIL / MAY 2019
Sixth Semester
Open Elective
15UMP01 – OPTIMIZATION TECHNIQUES
(Regulations: Mepco – R2015)
Duration: 3 Hours Maximum Marks:100
Max. : 100 Marks
Answer ALL Questions
Cog. PART A – (10  2 = 20 Marks)
U, CO1 1. The general assumption which is not correct in solving a sequencing
problem is____________.
A) the time taken by different jobs in moving from one machine to another
is negligible
B) the processing times on various machines are independent of the order
in which different jobs are processed on them
C) a job once started on a machine would be performed to the point of
completion uninterrupted
D) a machine can process more than one job at a given point of time.
R, CO1 2. What is “no passing rule” in sequencing problem?
U, CO2 3. Decision analysis is concerned with
A) decision making under certainty
B) analysis of information that is available
C) determining optimal decision in sequential manner
D) all of the above
R, CO3 4. Explain maximum likelihood criterion.
R, CO4 5. Mention the difference between fair game and strictly determinable game.
U, CO4 6. For a two person game with and , the minimizing and maximizing
players for optimum strategies are:
A) Minimax for P and Maximin for Q
B) Minimin for P and Maximin for Q
C) Maximax for P and Minimax for Q
D) Maximin for P and Minimax for Q
U, CO5 7. If an activity has zero slack, it implies that
A) it is a dummy activity
B) it lies on the critical path
C) there are more than one critical paths
D) the project is progressing well

1 15182
R, CO5 8. Explain the term “Spanning tree” in network analysis.
R, CO6 9. State Bellman’s optimality principle.
U, CO6 10. The general nonlinear programming problem with inequality constraints can
be solved by
A) Simplex method B) Lagrange’s method
C) Kuhn-Tucker conditions D) All of the above

PART B – (5  16 = 80 Marks)
A, CO1 11. a) i. Eight jobs A, B, C, D, E, F, G and H are to be processed on
a single machine.
Jobs A B C D E F G H
Processing
5 8 6 3 10 14 7 3
time (minutes)
Due date
15 10 15 25 20 40 45 50
(minutes)
Importance
1 2 3 1 2 3 2 1
weight
Assume that no new jobs arrive thereafter, determine
A) Optimal sequence as per WSPT rule
B) Completion time of the jobs
C) Lateness
D) Number of jobs actually late. (8 Marks)
A, CO1 11. a) ii. There are five jobs, each of which is to be processed through
four machines A, B, C and D in the order ABCD.

Job Processing times in hours

no.: A B C D
1 10 3 5 14
2 12 2 6 7
3 8 4 4 12
4 15 1 7 8
5 16 5 3 10
Find the sequence that minimizes the total elapsed time and
idle time for each machine. (8 Marks)
OR
A, CO1 11. b) i. Use graphical method to minimize the time added to process
the following jobs on the machines shown. That is, for each
machine, find the job which should be done first. Also,
calculate the total time elapsed to complete both the jobs.

2 15182
 Sequence time A B C D E
Job 1
3 4 2 6 2
Sequence time B C A D E
Job 2 (8 Marks)
5 4 3 2 6
A, CO1 11. b) ii. A manufacturing company processes 6 different jobs on two
machines and . Number of units of each job and its
processing time on and are given below:
No. of Processing time
Job
units of Machine A Machine B
no.:
each job (minutes) (minutes)
1 3 5 8
2 4 16 7
3 2 6 11
4 5 3 5
5 2 9 7.5
6 3 6 14
Find the optimal sequence, the total minimum elapsed time
and idle time for either machine. (8 Marks)

A, CO2 12. a) i. A super Bazaar must decide on the level of supplies it must
stock to meet the needs of its customers during Diwali days.
The exact number of customers is not known, but it is
expected to be in one of the four categories: 300, 350, 400
and 450 customers. Four levels of supplies are thus suggested
with level j being ideal (from the viewpoint of incurred costs),
if the number of customers falls in category j. Deviations
from the ideal levels results in additional costs either because
extra supplies are stocked needlessly or because demand
cannot be satisfied. The table below provides these costs in
thousands of rupees.
Supply Customer category
level
7 10 23 32
12 9 20 24
20 10 14 21
27 25 23 17
Determine which supply level to be selected if
A) Laplace criterion
B) Hurwicz criterion with coefficient of optimism as 0.6
were applied (6 Marks)

3 15182
A, CO2 12. a) ii. A newspaper boy has the following probabilities of selling a
magazine:
Number of 10 11 12 13 14
copies sold
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.
A) How many copies should he order?
B) Determine the expected opportunity losses.
C) Determine EVPI. (10 Marks)
OR
A, CO2 12. b) A client asks an estate agent to sell three properties and
for him and agrees to pay him 5% commission on each sale.
He specifies certain conditions. The estate agent must sell
property first, and this he must do within 60 days. If and
when 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 sell it in the period, he is given the opportunity to sell
the third property on the same conditions. The following table
summarizes the prices, selling costs and the estate agent’s
estimated probability of making a sale.
Prices of Selling Probability
Property
property cost of sale
A 12,000 400 0.7
B 25,000 225 0.6
C 50,000 450 0.5
A) Draw an appropriate decision tree for the estate agent.
B) What is the estate agent’s best strategy under EMV
approach? (16 Marks)

A, CO4 13. a) i. Two competitors are competing for the market share of the
similar product. The payoff matrix in terms of their
advertising plan is given below:
Competitor B

Competitor A [ ]

Suggest the optimal strategies for the two firms and the value
of the game for both the firms using dominance method. (8 Marks)

4 15182
A, CO4 13. a) ii. Obtain the optimal strategies for players A and B and the
value of the game by graphical method:
Player B

Player A

( ) (8 Marks)
OR
A, CO4 13. b) i. Solve the following game by oddments matrix method:
Player B

Player A [ ]
(8 Marks)
A, CO4 13. b) ii. Determine the range for the values and that will make
the payoff element as a saddle point for the game whose
payoff matrix is given below:
Player B

Player A ( )
(8 Marks)

A, CO5 14. a) i. Use Dijkstra’s algorithm to determine the shortest path from
node 1 to node 8.
8
2 6

3 4
2 3 3

6 4 7
1 3 5 8

3 4 2
5 3

4 7 7
(6 Marks)
A, CO5 14. a) ii. A small project consists of seven activities for which the
relevant data are given below:
Activity A B C D E F G
Preceding activities A,B A,B C,D,E C,D,E
Activity duration
4 7 6 5 7 6 5
(in days)
A) Draw the arrow diagram
B) Identify the critical path and find the total project
duration. (10 Marks)
OR

5 15182
A, CO5 14. b) The following table gives data on normal time-cost and crash-
time cost for a project:
Normal Crash
Activity Time Cost Time Cost
(days) (Rs.) (days) (Rs.)
6 600 4 1000
4 600 2 2000
5 500 3 1500
3 450 1 650
6 900 4 2000
8 800 4 3000
4 400 2 1000
3 450 2 800
A) If the indirect cost per day is Rs.100/-, find the least cost
schedule.
B) What is the optimum duration?
(16 Marks)

A, CO6 15. a) Use dynamic programming to find the value of

Maximize
subject to
where (16 Marks)
OR
A, CO6 15. b) i. Solve the nonlinear programming by using Kuhn-Tucker
condition: Maximize subject to
, (8 Marks)
A, CO6 15. b) ii. Solve the nonlinear programming by Lagrangian multiplier
method:
Optimize
subject to , (8 Marks)

6 15182