Be-Mech Sem7 or May19 PDF

48 F 1F 1F B 8B 0 F BE AC
48 EF6 61F 21F 6B4 48B 008 80F3 3BE AC 060

E 1 21 6B 8 00 0 B A 0 E
EF F61F F21 F6B 48B B00 80F F3B EAC C06 60EC C69
F 8 E 0 4
F6 61F2 21F6 6B4 48B0 008 0F3 3BE AC 060 EC6 694 8EF
1F 1F B 8B 08 0F BE AC 060 EC 94 8E 61
61 21 6B 48 00 0 3B A 06 E 69 8 F6 F2
F F 4 B 8 F3 E C 0 C 4 EF 1 1
F2 21F6 6B4 8B0 0080 0F3 BEAAC0 060E EC6 6948 8EF 61F F21F F6B
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48
21 6B 8 00 0F B A 06 E 69 8E 6 F2 F6 4 B0
F B E C C 1 8
1F 6B4 48B 008 80F3 3BE AC 060 0EC 694 48EF F61 F21 1F6B B48 B00 080
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80 F3
Q.2
Q.1
N.B:
55931
6B 48B 00 80F 3B EAC 06 0EC 69 48E F61 F2 1F6 B4 8B0 080 F3 BEA
8 E 4 1 8 B
B4 48B 008 0F3 3BE AC 060 0EC 694 8EF F61F F21 F6B B48 B00 080F F3B EA C06
8B 008 0F BE AC 060 EC 694 8E 61 21 F6 48 B0 80 3B EA C0 0E
48 00 0F 3B A 06 E 69 8E F6 F2 F B4 B 08 F3 E C 60 C
B0 80 3 EA C0 0E C6 48 F 1F 1F 6B 8B 00 0F BE AC 06 EC 69
i)
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
ii)
0F BE AC 06 EC 69 8E 61 2 F6 48 B0 80 3B EA C0 0E C6 48 F
3B A 06 0E 69 48 F6 F2 1F B4 B 08 F3 E C 60 C 94 EF 61F
EA C0 0E C6 48 EF 1F 1F 6B 8B 008 0F BE AC 060 EC 694 8E 61 21
C0 60E C6 948 EF 61F 21F 6B 48B 008 0F 3BE AC 06 EC 694 8E F61 F21 F6
60 C6 94 EF 61F 21 6B 48B 00 0F 3B A 06 0EC 69 8E F6 F2 F6 B4
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
69 8E F61 F2 F6 B4 B0 080 F3B EA C0 60E C6 948 EF 1F 21F 6B 48B 008
Wednesday, May 29, 2019
𝑐+𝑑
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
Product B
a)For the game [
Product C
Product A
EF 1F 21 6B 8B 00 0F B AC 06 EC 69 8E 6 F2 F6 4 B0 80 3
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
F2 F6 4 B0 80 F3 EA C0 0E C6 48 EF 1F 1F 6B 8B 00 0F BE AC
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80 F3 EA C0 0E
48 00 80F 3B EA 06 0E 69 48E F6 F2 1F B4 8B 08 F3 BE C 60 C
−𝑐 𝑑
𝑎 −𝑏
𝑎+𝑏
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
And 𝑥1 𝑎𝑛𝑑 𝑥2 ≥ 0
needed to complete the work

(CBSGS) / 42813 - 9)Operations Research
(1) Question no 1 is compulsory
3𝑥1 − 2𝑥2 ≥ 6
(5) Notations carry usual meaning
8𝑥1 + 2𝑥2 ≥ 16
0
4
5
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
Answer any four of the following:
Subject to 5𝑥1 + 10𝑥2 ≤ 50

Maximize Z =100𝑥1 + 80𝑥2
Lathe
to yield maximum profit?

(4) Assume Suitable data if necessary
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
Time: 3 Hours
b)Solve the LPP by Graphical method:

61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE 𝑏+𝑑
10:30 am - 01:30 pm
(3) Figures to the right indicate full marks
55931
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
c)Explain Bellman’s Principle of optimality

Page 1 of 3
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
𝑎+𝑐
(2) Attempt any three out of remaining five questions
products on different machines is given in Table below:
clearly the assumptions if any, made by you.

EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
5
3
9
C6948EF61F21F6B48B0080F3BEAC060E
e)Define a queue. State the characteristics of waiting line.

48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
Milling
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
𝑎𝑑−𝑏𝑐
Paper / Subject Code: 42813 / 9)Operations Research
A[𝑎+𝑏+𝑐+𝑑 , 𝑎+𝑏+𝑐+𝑑]; B [𝑎+𝑏+𝑐+𝑑 , 𝑎+𝑏+𝑐+𝑑] and v= 𝑎+𝑏+𝑐+𝑑.
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E

Marks: 80
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8
69 8E F61 F2 F6 B4 B0 080 F3B EA C0 60E C6 948 EF 1F 21F 6B 48B
2
0
3
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 0
EF 1F 21 6B 8B 00 0F B AC 06 EC 69 8E 6 F2 F6 4 B0
1T01417 - B.E.(MECHANICAL)(Sem VII)
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 0
Grinder
(10 marks)
F2 F6 4 B0 80 F3 EA C0 0E C6 48 EF 1F 1F 6B 8B 00
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 8
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80
48 00 80F 3B EA 06 0E 69 48E F6 F2 1F B4 8B 08 F
B0 80 3 EA C0 0E C6 48 F 1F 1F 6B 8B 00 0F
d) How do you test initial feasible solution for optimality by Stepping Stone method.(05)
(05)
] where a,b,c,d are all ≥ 0 prove that the optimal strategies are:
(05)
(05)
(05)
take more or less than 30 minutes depending on type of dental work to be done. The
b) A dentist schedules all her patients for 30 minutes appointments. Some of the patients
following summary shows the various categories of work, their probabilities and time
RS.30,product B Rs.12 and product C Rs.15.The time taken by each unit of the three
How much quantity of products A, B and C must be manufactured every week

offered products A, B and C to be manufactured. Each unit of product A yields
a) A jobbing shop has three machine groups, namely lathes, milling machines and grinders.
It has an idle capacity of 350 hours, 500 hours and 150 hours per week respectively. It is
What capacity of each machine remains idle after making these products? State
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3
0F BE AC 06 EC 69 8E 61 2 F6 48 B0 80 3B
3B A 06 0E 69 48 F6 F2 1F B4 B 08 F3
EA C0 0E C6 48 EF 1F 1F 6B 8B 008 0F BE
C0 60E C6 948 EF 61F 21F 6B 48B 008 0F 3BE
60 C6 94 EF 61F 21 6B 48B 00 0F 3B A
EC 94 8E 61 21 F6 48 0 80 3B EA
69 8E F61 F2 F6 B4 B0 080 F3B EA C
48 F6 F 1F B4 8B 08 F3 E C
E 2 6 0 0 A 0
48 EF6 61F 21F 6B4 48B 008 80F3 3BE AC 060
E 1 21 6B 8 00 0 B A 0 E
F 8 E 0 4
F6 61F2 21F6 6B4 48B0 008 0F3 3BE AC 060 EC6 694 8EF
1F 1F B 8B 08 0F BE AC 060 EC 94 8E 61
61 21 6B 48 00 0 3B A 06 E 69 8 F6 F2
F F 4 B 8 F3 E C 0 C 4 EF 1 1
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48
21 6B 8 00 0F B A 06 E 69 8E 6 F2 F6 4 B0
F B E C C 1 8
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80 F3
Q.4
Q.3
55931
8 E 4 1 8 B
48 00 0F 3B A 06 E 69 8E F6 F2 F B4 B 08 F3 E C 60 C
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
Filling
Crown
E
B
D
C
A
Cleaning
maximum.
Category
C0 60E C6 948 EF 61F 21F 6B 48B 008 0F 3BE AC 06 EC 694 8E F61 F21 F6 Check-up
Batting
Position
Extraction
Batsman
Warehouse
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
barber’s chair.
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
Demand
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
B
C
A
58
20
50
42
40
warrant a second barber?

III
warehouse to each market.

08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
15
45
15
60
45
7
5
5
6
P
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
60
19
48
30
40
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE IV
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
Page 2 of 3
7
9
3
12
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
V
59
20
40
16
35
Market
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
8
2
5
R
17
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
iii) How much time can a customer expect to wait for his turn?
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
iv) How much time can a customer expect to spend in the shop?
ii) What is the expected number of customers in the barber shop?

0.20
0.10
0.15
0.15
0.40
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
55
18
60
25
25
VI
numbers for handling the above problem.40,82,11,34,25,66,17 and 79.
9
6
7
4
S
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 0
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 0
i) What is the probability that a new arrival need not wait for the barber to be free?
53
25
50
27
50
8
VII
15
22
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 8
Time required (minutes) Probability of category
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80
(10 marks)
Supply
48 00 80F 3B EA 06 0E 69 48E F6 F2 1F B4 8B 08 F
B0 80 3 EA C0 0E C6 48 F 1F 1F 6B 8B 00 0F
(10 marks)
(10 marks)
Make the assignment so that the expected total average runs scored by these batsmen are
a) A captain of a cricket team has to allot five middle order batting positions to five
patients as well as the idleness of the doctor. Assume that all the patients show up at the
in the shop exceeds 1.25 hours. How much must the average rate of arrivals increase to
a) The following table has all necessary information on availability of supply to each
warehouse, the requirement of each market and unit transportation cost (in Rs.) from each
Simulate the dentist’s clinic for four hours and determine the average waiting time for the
v) Management will put in another and hire another barber when customer’s average time
inter arrival time of 20 minutes. Customers spend on an average of 15 minutes in the
b) Customers arrive at one person barber shop according to Poisson process with mean
batsmen. The average runs scored by each batsman at these positions are given in the table.
clinic exactly as per scheduled arrival times, starting 8 A.M.Use following random
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3
0F BE AC 06 EC 69 8E 61 2 F6 48 B0 80 3B
3B A 06 0E 69 48 F6 F2 1F B4 B 08 F3
EA C0 0E C6 48 EF 1F 1F 6B 8B 008 0F BE
C0 60E C6 948 EF 61F 21F 6B 48B 008 0F 3BE
60 C6 94 EF 61F 21 6B 48B 00 0F 3B A
EC 94 8E 61 21 F6 48 0 80 3B EA
69 8E F61 F2 F6 B4 B0 080 F3B EA C
48 F6 F 1F B4 8B 08 F3 E C
E 2 6 0 0 A 0
48 EF6 61F 21F 6B4 48B 008 80F3 3BE AC 060
E 1 21 6B 8 00 0 B A 0 E
F 8 E 0 4
F6 61F2 21F6 6B4 48B0 008 0F3 3BE AC 060 EC6 694 8EF
1F 1F B 8B 08 0F BE AC 060 EC 94 8E 61
61 21 6B 48 00 0 3B A 06 E 69 8 F6 F2
F F 4 B 8 F3 E C 0 C 4 EF 1 1
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48
21 6B 8 00 0F B A 06 E 69 8E 6 F2 F6 4 B0
F B E C C 1 8
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80 F3
Q.6
Q.5
55931
8 E 4 1 8 B
48 00 0F 3B A 06 E 69 8E F6 F2 F B4 B 08 F3 E C 60 C
B0 80 3 EA C0 0E C6 48 F 1F 1F 6B 8B 00 0F BE AC 06 EC 69 i)
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
3B A 06 0E 69 48 F6 F2 1F B4 B 08 F3 E C 60 C 94 EF 61F ii)
iv.
v.
ii.
i.
Job
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
Where 𝑥, 𝑦 ≥ 0
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
𝑦 ≥ 60
Machine B
Machine C
Machine A
𝑥 ≤ 80
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
Minimize Z=3x+8y
with it.
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
Subject to 𝑥 + 𝑦 = 200
6
7
1
a) Using Big-M method,
12
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
b) Given the following data:

from C to P,1 unit from C to R.
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
5
6
2
10
Assume scrap value to be negligible.

48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
of one unit is Rs.300 per year. Determine:
Order of processing: A-C-B

1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
Is the given sequence optimal?

iii) Maximum inventory level in the cycle and
Page 3 of 3
6
6
9
3
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
ii) The manufacturing time and the time between setup

Suggested sequence of Jobs: 5-3-6-2-1-4

EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8B
4
5
4
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 00 0F
14
respect to Player A and find optimal solution for this game.
i) The optimum manufacturing quantity and no. of shortages

61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 08 F3 BE
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 80 3B A 06
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E
2
4
7
5
iii. Determine the total elapsed time for sequence suggested.

iv) Total associated cost per year if the cost of an item is Rs.25 per unit.
Find optimal schedule and minimum total transportation cost.

Check and see if the clerk has worked out the optimal schedule
(10 marks)
EC 94 8E 61 21 F6 48 0 80 3B EA C0 0E 6 48 F6 1F 1F B 8
(10 marks)
The shipping clerk has worked out the following schedule from his experience:
48 F6 F 1F B4 8B 08 F3 E C 60 C 94 EF 61 21 6B 48 0
4
4
9
6
61 21 F6B 48 00 80 3B EA 06 0E 69 48 F6 1F2 1F B4 8B 0
1F B4 8B 08 F3 BE C 60 C 94 EF 61 21 6B 48 00 8
6B 8B 00 0F B AC 06 EC 69 8E 61 F2 F6 4 B0 80
48 00 80F 3B EA 06 0E 69 48E F6 F2 1F B4 8B 08 F
(10 marks)
B0 80 3 EA C0 0E C6 48 F 1F 1F 6B 8B 00 0F
(10 marks)
(10 marks)
(10 marks)
both the players is an odd number, then Player A has to give money in rupees equivalent
to the number of fingers shown by him to Player B.Construct the playoff matrix with
per year thereafter. If money is worth 10% per year, which machine should be purchased?
costs are estimated as Rs.1600 for each of the first five years, increasing by Rs.400 per
players is an even number, then player B has to give money in rupees equivalent to the
12 units from A to Q,1 unit from A to R,8 units from A to S,15 units from B to R,7 units
selected fingers of his right hand. If the sum of the number of fingers shown by both the
b) The demand for an item is deterministic and constant over time and it is equal to 24000
a) A manufacturer is offered two machines A and B.A is priced at Rs.10,000 and running
Rs 5000 but will have running costs of Rs.2400 per year for six years, increasing by Rs.400
units per year and company can produce the item at a rate of 4000 per month. The cost of
one setup is Rs.600 and the carrying cost is 20 paisa per unit per month. The shortage cost
If No, then determine the optimal sequence and total elapsed time associated
b) There are two players in a game, Player A and Player B.Each of them randomly shows
year in the sixth and subsequent years. Machine B which has the same capacity as A, costs
number of fingers shown by him to Player A; if the sum of number of fingers shown by
08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3
0F BE AC 06 EC 69 8E 61 2 F6 48 B0 80 3B
3B A 06 0E 69 48 F6 F2 1F B4 B 08 F3
EA C0 0E C6 48 EF 1F 1F 6B 8B 008 0F BE
C0 60E C6 948 EF 61F 21F 6B 48B 008 0F 3BE
60 C6 94 EF 61F 21 6B 48B 00 0F 3B A
EC 94 8E 61 21 F6 48 0 80 3B EA
69 8E F61 F2 F6 B4 B0 080 F3B EA C
48 F6 F 1F B4 8B 08 F3 E C
E 2 6 0 0 A 0

Be-Mech Sem7 or May19 PDF

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Be-Mech Sem7 or May19 PDF

Transféré par

Droits d'auteur :

Formats disponibles

48 F 1F 1F B 8B 0 F BE AC

48 EF6 61F 21F 6B4 48B 008 80F3 3BE AC 060

needed to complete the work

(1) Question no 1 is compulsory

Subject to 5𝑥1 + 10𝑥2 ≤ 50

Maximize Z =100𝑥1 + 80𝑥2

to yield maximum profit?

b)Solve the LPP by Graphical method:

c)Explain Bellman’s Principle of optimality

60 C6 94 EF 61F 21 6B 48B 00 0F 3B A 06 0EC 69 8E F6 F2 F6 B4

products on different machines is given in Table below:

clearly the assumptions if any, made by you.

e)Define a queue. State the characteristics of waiting line.

08 F3 BE C 60 C 94 EF 61F 21 6B 48 00 80F 3B A 06 0E 69 48E

How much quantity of products A, B and C must be manufactured every week

warrant a second barber?

warehouse to each market.

60 C6 94 EF 61F 21 6B 48B 00 0F 3B A 06 0EC 69 8E F6 F2 F6 B4

60 C6 94 EF 61F 21 6B 48B 00 0F 3B A 06 0EC 69 8E F6 F2 F6 B4

ii) What is the expected number of customers in the barber shop?

b) Given the following data:

Assume scrap value to be negligible.

of one unit is Rs.300 per year. Determine:

Order of processing: A-C-B

Is the given sequence optimal?

iii) Maximum inventory level in the cycle and

ii) The manufacturing time and the time between setup

Suggested sequence of Jobs: 5-3-6-2-1-4

i) The optimum manufacturing quantity and no. of shortages

iii. Determine the total elapsed time for sequence suggested.

EA C0 0E C6 48 EF 1F 1F 6B 8B 008 0F BE AC 060 EC 694 8E 61 21

Vous aimerez peut-être aussi