Reg. No.

Question Paper Code : 19758

B.E. / B.TECH. DEGREE EXAMINATIONS, MAY / JUNE 2023

Sixth Semester
Open Elective
19UMP01 – OPTIMIZATION TECHNIQUES
(Regulations: Mepco – R2019)
Duration: 3 Hours Max. : 100 Marks

Answer ALL Questions

BTL, CO PART A – (10  2 = 20 Marks)
A, CO1 1. A company has three operational departments (weaving, processing and packing)
with capacity to produce three different types of clothes namely suitings, shirtings
and woolens yielding a profit of Rs.2, Rs.4 and Rs.3 per metre respectively. One
meter of suiting requires 3 minutes in weaving, 2 minutes in processing and 1
minute in packing. Similarly one metre of shirting requires 4 minutes in weaving, 1
minute in processing and 3 minutes in packing. One metre of woollen requires
3minutes in each department .In a week, total run time of each department is 60, 40
and 80 hours for weaving, processing and packing respectively. Formulate this
problem as a linear programming problem to find the product mix to maximize the
profit.
R,CO1 2. Define nonlinear programming problem.
R, CO2 3. In sequencing problem ________. Justify your answer.
A) The selection of an appropriate order for a series of jobs is to be done on a
finite service facilities
B) All the jobs must be processed on a first come first service basis
C) A service facility can process more than one job at a time
D) All the service facilities are not of different type
R,CO2 4. What is meant by ‘’no passing’’ rule in a sequencing algorithm?
R,CO3 5. Which of the following is not used for decision –making under uncertainty? Justify
your answer.
A) Minimax criterion B) Maximax criterion
C) Minimize expected loss criterion D) Maximin criterion
R,CO3 6. State Hurwicz criterion in decision analysis.
R,CO4 7. A game is said to be fair, if ___________. Justify your answer.
A) Upper value is more than lower value of the game
1
19758
 B) Upper value and lower value of the game are not equal
C) Upper value and lower value of the game are same and zero
D) None of the above
A,CO4 8. Identify the saddle point in the following game:
Player B

Player A( )

U,CO5 9. The critical path in network scheduling is ___________. Justify your answer.
A) Path connecting the first initial node to very last terminal node of longest
duration in any project network
B) Path connecting the first initial node to very last terminal node of shortest
duration in any project network
C) Path connecting the first initial node to very last terminal node of average
duration in any project network
D) Path connecting the second node to very last terminal node of average duration
in any project network
U,CO5 10. In Programme evaluation technique ___________ is the duration of any activity
when sometimes things go on very well, sometimes things go on very bad while
doing project. Justify your answer.
A) Optimistic time estimate B) Pessimistic time estimate
C) Most likely time estimate D) Idle time

PART B – (5  16 = 80 Marks)
A,CO1 11. a) i. Solve the following linear programming problem by graphical
method:

Subject to the constraints:

(8 Marks)

2
19758
A,CO1 11. a) ii. By applying the Lagrangian multipliers method to solve the
following NLPP :

Subject to the constraint:

(8 Marks)
OR
A,CO1 11. b) Solve the following nonlinear programming problem by using the
Kuhn- Tucker conditions:

Subject to the constraints:

(16 Marks)

A,CO2 12. a) i. There are five jobs, each of which is to be processed through two
machines M1, M2 in the order of M1M2. Processing hours are given
in the following table:
Job 1 2 3 4 5
M1 3 8 5 7 4
M2 4 10 6 5 8

Determine the optimum sequence for the five jobs, and minimum
total elapsed time. Also, compute the ideal time of machines M1 and
M2. (8 Marks)
A,CO2 12. a) ii. Determine the minimum time needed to process the two jobs on four
machines M1, M2, M3 and M4 by graphically. The technological order
for these jobs is given below:
Job1 M1 M2 M3 M4
Job2 M4 M2 M1 M3
The processing time(in hours) are as given below:
M1 M2 M3 M4
Job1 5 7 8 4
Job2 5 8 6 9 (8 Marks)

OR

3
19758
A, CO2 12. b) Jobs 1, 2, 3 and 4 are to be processed on each of the five machines A,
B, C, D and E in the order ABCDE. Obtain the total minimum
elapsed time if no passing of jobs is permitted. Also, compute the
idle time for each machine.

Machines
Jobs
A B C D E
1 7 5 2 3 9
2 6 6 4 5 10
3 5 4 5 6 8
(16 Marks)
4 8 3 3 2 6

A, CO3 13. a) i. A man has the choice of running either a hot-snack stall or an ice
cream stall at a seaside during the summer season. If it is a fairly
cool summer, he should make Rs.5,000 by running the hot-snock
stall, but if the summer is quite hot he can only expect to make
Rs.1000. On the other hand, if he operates the ice-cream stall, his
profit is estimated at Rs.6,500 if the summer is hot, but only Rs.1000
if it is cool. There is a 40 % chance of the summer being hot. Should
he opt for running the hot-snack stall or the ice creams stall? Justify
your conclusion. (8 Marks)
A, CO3 13. a) ii. The estimated sales of proposed types of perfumes are as under:
Types of Estimated levels of sales(units)
perfumes Rs.20,000 Rs.10,000 Rs.20,000
A 25 15 10
B 40 20 5
C 60 25 3
For each of the following decisions criteria, state the optimal action
and specify the value leading to its selection:
A) Maximin criterion B) Laplace criterion
C) Savage criterion (8 Marks)

OR
A, CO3 13. b) Amar company is currently working with a process which after
paying for materials, labour, etc., brings a profit of Rs.12,000. The
following alternatives are made available to the company:
A) The company can conduct research (R1) which is expected to
cost Rs.10,000 having 90 % chances of success. If it proves a
success, the company gets a gross income of Rs. 25,000.
B) The company can conduct research(R2) which is expected to
cost Rs.8,000 having a probability of 60 % success, the gross
4
19758
 income will be Rs. 25,000.
C) The company can pay Rs.6,000 as royalty for new process
which will bring a gross income of Rs.20,000.
D) The company continues the current process.
Because of limited resources, it is assumed that only one of the two
types of research can be carried out at a time. By applying decision
tree analysis to locate the optimal strategy for the company. (16 Marks)

A, CO4 14. a) i. Consider a ‘’modified’’ form of ‘’matching biased coins’’ game

problem. The matching player is paid Rs.8.00 if the two coins turn
both heads and Rs.1.00 if the coins turns both tails. The non-
matching player is paid Rs.3.00 when the two coins do not match.
Given the choice of being the matching or non-matching player,
which one would you choose and what would be your strategy? (8 Marks)

A, CO4 14. a) ii. Use matrix oddment method to solve the following 3 game:

( )
(8 Marks)
OR
A, CO4 14. b) i. Solve the following game graphically :
Player B

Player A ( )
(8 Marks)
A, CO4 14. b) ii. Applying dominance property to solve the following game :
Player B

Player A [ ]
(8 Marks)

A, CO5 15. a) Construct the network for the project whose activities and the three
time estimates of these activities (in weeks) are given below.
Compute A) Expected duration of each activity B) Expected
variance of each activity C) Expected variance of the project length.

5
19758
 Activity Optimistic Most Pessimistic
time likely time
time
1-2 3 4 5
2-3 1 2 3
2-4 2 3 4
3-5 3 4 5
4-5 1 3 5
4-6 3 5 7
5-7 4 5 6
6-7 6 7 8
7-8 2 4 6
7-9 1 2 3
8-10 4 6 8 (16 Marks)
9-10 3 5 7
OR
A, CO5 15. b) The following data is pertaining to a project with normal time and
crash time (in weeks):

Jobs Normal Crash

Time Cost Time Cost
1-2 8 100 6 200
1-3 4 150 2 350
2-4 2 50 1 90
2-5 10 100 5 400
3-4 5 100 1 200
4-5 3 80 1 100
A) If the indirect cost is Rs.100 per day, find the least cost schedule
(optimum duration).
B) What is the minimum duration? (16 Marks)

6
19758