0% found this document useful (0 votes)
16 views6 pages

Question Paper Code: 18431: Reg. No

This document is a question paper for the B.E. / B.Tech. degree examination in Optimization Techniques for the sixth semester, covering various topics such as linear programming, sequencing problems, decision-making criteria, game theory, and project management. It consists of two parts: Part A with short answer questions and Part B with detailed problem-solving questions. The exam duration is 3 hours, and the maximum marks are 100.

Uploaded by

24ukm047
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views6 pages

Question Paper Code: 18431: Reg. No

This document is a question paper for the B.E. / B.Tech. degree examination in Optimization Techniques for the sixth semester, covering various topics such as linear programming, sequencing problems, decision-making criteria, game theory, and project management. It consists of two parts: Part A with short answer questions and Part B with detailed problem-solving questions. The exam duration is 3 hours, and the maximum marks are 100.

Uploaded by

24ukm047
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Reg. No.

Question Paper Code : 18431

B.E. / B.TECH. DEGREE EXAMINATION, MAY / JUNE 2022


Sixth Semester
Open Elective
19UMP01 – OPTIMIZATION TECHNIQUES
(Regulations: Mepco – R2019)
(Normal table is permitted)
Duration: 3 Hours Maximum Marks:100
Max. : 100 Marks
Answer ALL Questions

BTL, CO PART A – (10  2 = 20 Marks)


R,CO1 1. Define unbounded solution in linear programming problem.
U, CO1 2. A feasible solution to an linear programming problem _________. Justify your
answer.
A) Must optimize the value of the objective function
B) Must be a corner point of the feasible region
C) Need not satisfy all of the constraints, only some of them
D) Must satisfy all of the problem’s constraints simultaneously
U, CO2 3. If there are ‘n’ jobs to be performed one at a time on each of ‘m’ machines, the
possible sequences would be ________. Justify your answer.
A) B) C) D)
R, CO2 4. List any four assumptions in sequencing problem.

U, CO3 5. The value of the coefficient of optimism ‘α’ is needed, while using the criteria of
___________. Justify your answer.
A) Equally likely B) Realism C) Maximin D) Minimax
U, CO3 6. A manager must choose between two investments A and B which are calculated to
yield net profits of $ 1,200 and $ 1,600 respectively with probabilities subjectively
estimated at 0.75 and 0.60. Assume the manager’s utility function reveals that
utilities for $ 1,200 and $ 1,600 are 45 and 50 units respectively. What is the best
choice on the basis of expected utility value?

1
18431
U, CO4 7. The size of the payoff matrix of a game can be reduced by using the principle of
____________. Justify your answer.
A) Game inversion B) Dominance
C) Rotation reduction D) Game transpose
R, CO4 8. Define two-person zero-sum game.
U, CO5 9. The activity which can be delayed without affecting the execution of the immediate
succeeding activity is determined by ___________. Justify your answer.
A) Independent float B) Free float
C) Total float D) None of the above
R, CO5 10. Define critical path in network.

PART B – (5  16 = 80 Marks)

A, CO1 11. a) i. Use the Graphical Method to solve the following Linear
Programming Problem:
Maximize
subject to the constraints

and

(10 Marks)

A, CO1 11. a) ii. A company produces two types of sauces: A and B. These sauces
are both made by blending two ingredients X and Y. A certain level
of flexibility is permitted in the formulae of these products. Indeed,
the restrictions are that
A) B must contain no more than 75 per cent of X.
B) A must contain no less than 25 per cent of X and no less
than 50 per cent of Y.
Up to 400 kg of X and 300 kg of Y could be purchased. The
company can sell as much of these sauces as it produces at a price of
$ 18 for A and $ 17 for B. The X and Y cost $ 1.60 and $ 2.05 kg,
respectively. The company wishes to maximize its net revenue from
the sale of these sauces. Formulate this problem as Linear
Programming model. (6 Marks)
OR

2
18431
A, CO1 11. b) Solve the following by the method of Lagrangian multipliers

subject to the constraints

(16 Marks)

A, CO2 12. a) i. Find the sequence that minimizes the total elapsed time required to
complete the following task on two machines and also find total
elapsed time and idle time on 2 machines.

Task A B C D E F G H I
Machine I 2 5 4 9 6 8 7 5 4
Machine II 6 8 7 4 3 9 3 8 11
(8 Marks)
A, CO2 12. a) ii. Using graphical method, calculate minimum elapsed time needed to
process the following 2 jobs on 5 machines.

Machines

Job 1 Sequence A B C D E

Processing time 3 4 2 6 2
Job 2 Sequence B C A D E

Processing time 5 4 3 2 6 (8 Marks)


OR
A,CO2 12. b) Find the optimum sequence of following sequencing problem of 4
Jobs and 4 machines when passing is not allowed. The processing
times of different jobs on different machines are given as under
Processing Time (in Hrs.)
Job 1 2 3 4
Machine 1 15 12 13 16
Machine 2 5 2 3 0
Machine 3 4 10 6 3
Machine 4 14 12 15 19
Also, find total elapsed time.
(16 Marks)

3
18431
A, CO3 13. a) i. A manufacturer makes a product, of which the principal ingredient is
a chemical At the moment, the manufacturer spends Rs. 1,000 per
year on supply of but there is a possibility that the price may soon
increase to four times its present figure because of a worldwide
shortage of the chemical. There is another chemical which the
manufacturer could use in conjunction with a third chemical, in
order to give the same effect as chemical Chemical and Z
would together cost the manufacturer Rs. 3,000 per year, but their
prices are unlikely to rise. What action should the manufacturer take?
Apply the maximin and minimax regret criteria for decision-making
criteria for decision-making and give two sets of solution. If the
coefficient of optimism is 0.4, find the course of action that
minimizes the cost.
(10 Marks)
A, CO3 13. a) ii. The probability of the demand for lorries for hiring on any day in a
given district is as follows:

No. of lorries demanded: 0 1 2 3 4


Probability 0.1 0.2 0.3 0.2 0.2

Lorries have a fixed cost of $ 90 each day to keep the daily hire
charges (net of variable costs of running) $ 200. If the lorry-hire
company owns 4 lorries, what is its daily expectation? If the
company is about to go into business and currently has no lorries,
how many lorries should it buy?
(6 Marks)
OR
A, CO3 13. b) A businessman has two independent investment portfolios ‘A’ and
‘B’ available to him, but he lacks the capital to undertake both of
them simultaneously. He can choose ‘A’ first and then stop, or if ‘A’
is successful, then take, ‘B’ or vice versa. The probability of success
of ‘A’ is 0.6, while for ‘B’ it is 0.4. Both investment schemes require
an initial capital outlay of $ 10,000 and both return nothing if the
venture is unsuccessful. Successful completion of ‘A’ will return
$ 20,000 (over cost) and successful completion of ‘B’ will return
$ 24,000 (over cost). Draw decision tree and determine the best
strategy.
(16 Marks)

4
18431
A, CO4 14. a) i. Solve the following game graphically. Where the pay-off matrix of
player ‘A’ has been prepared as under.
Player B
Player A
1 5 -7 -4 2
2 4 9 -3 1
(8 Marks)
A, CO4 14. a) ii. For the following pay-off matrix of firm ‘A’, determine the optimal
strategies for both the firms A and B. Also find the value of the
game.
Firm B
Firm A
6 -2 8 12 14
-2 16 4 8 24
32 16 12 28 24
2 22 -8 4 2
(8 Marks)
OR
A, CO4 14. b) i. Solve the following game after reducing it to a game:

Player B
Player A
1 7 2
6 2 7
5 1 6 (10 Marks)
A, CO4 14. b) ii. For what value of , the game with the following matrix is strictly
determinable?
Player B

Player A [ ]

(6 Marks)

5
18431
A, CO5 15. a) The following table gives the activities in a construction project and
other relevant information:

Activity Immediate Predecessor Time (Months) Direct cost (in Rs.)


Normal Crash Normal Crash
A - 4 3 60 90
B - 6 4 150 250
C - 2 1 38 60
D A 5 3 150 250
E C 2 2 100 100
F A 7 5 115 175
G D, B, E 4 2 100 240

Indirect cost vary as follows:


Month 15 14 13 12 11 10 9 8 7 6
Cost (Rs.) 600 500 400 250 175 100 75 50 35 25

A) Draw a network diagram.


B) Determine the project duration which will result in minimum total
project cost.
(16 Marks)
OR
A, CO5 15. b) The manpower requirements for each activity in a project are given as
under.

Activity 0-1 1-2 1-3 2-4 3-5 3-6


Normal time 2 3 4 2 4 3
Manpower required 4 3 3 5 3 4

Activity 4-7 5-7 6-8 7-9 8-9


Normal time 6 6 5 4 4
Manpower required 3 6 2 2 9

A) Draw network diagram of project activities and compute earliest


and latest completion time.
B) Find total float and free float for each activity.
C) Level resources (man power) as far as possible (resource leveling
case)
(16 Marks)

6
18431

You might also like