7C 6E E 2D C4 0F 7 DB 8 7E

6 9
C3 36E6 6E6 62D C42 20FF F76 DB 789 7EB BBD
6E E6 2D C4 0F 76 DB 789 7E BD 1F
36 6E 2 C 20 F7 D 78 7E BB 1 9F
E D 4 F B
6E 6E6 62D C4 20F F76 6DB 789 97E BBDD1F F9F7 7C3
6E 2D C4 20F F7 DB 78 7E BB 1 9F C 6E
6E 62D C4 20F F7 6DB 78 97E BB D1 F9F 7C 36E 6E6
6 9 F 3
E6 62D C42 20FF F76 DB 789 7EB BBDD1F 9F7 7C3 6E6 6E62 2DC
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42
78259

62 C 20 F7 D 78 7 BB D1 9 7C 6E 6E 2D C4 0F
D 4 E F
2D C4 20F FF76 6DB B789 97E BB D1F F9F 7C3 36E 6E6 62D C42 20FF F76
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB

N.B:

Q.3
Q.2
Q.1
26-Nov-2019

C4 20F F7 6DB 78 97E BB D1 F9F 7C 36E 6E6 2D C42 0F F76 DB 789

78259
2 6 9 B D F 7 3 6 C F D 7 7
3 Hours
42 0FF F76DDB7 7897 7EB BD 1F9 9F7 C36 6E6 E62 2DC 420 0FF 76D B7 897 EB
0F 76 B 89 E B 1F F C3 E6 E6 DC 42 FF 76 B7 89 EB BD
20 F7 D 78 7E BB D1 9F 7C 6E E 2D 4 0F 7 DB 8 7E B 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6

S3
S2
S1
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6

Subject to
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D

Subject to ,

Demand
𝑥1 − 𝑥2 ≤ 2
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C

𝑥1 + 𝑥2 ≤ 4,
𝑥1 − 𝑥2 ≤ 10
𝑥1 + 2𝑥2 = 8
𝑥1 − 2𝑥2 ≥ 2
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76

Where 𝑥1 , 𝑥2 ≥ 0
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78

transportation plan.
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB

5
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD

40
70
19
D1
Maximize Z=3𝑥1 + 2𝑥2
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C Maximise Z= 𝟒𝒙𝟏 + 𝟐𝒙𝟐
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3

1) Average queue length

a) Solve by Simplex Method:
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
(1) Question no 1 is compulsory

EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
(5) Notations carry usual meaning

BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C

1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
(4) Assume Suitable data if necessary

a)Write the dual of the following LPP

8
8
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76

30
30
D2
Where𝑥1 ≥ 0,𝑥2 is unrestricted in sign.

4) Mean waiting time of an arrival

36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78
(3) Figures to the right indicate full marks

E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97

2) Average length of non empty queue

2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB

Page 1 of 3
Answer any four of the following questions:

C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD

d) Enlist assumptions in sequencing problem.

3) Average number of workers in system

b)What are assumptions made in game theory
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6

7
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6

70
40
50
D3
(2) Attempt any three out of remaining five questions

EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420

D1F9F7C36E6E62DC420FF76DB7897EBB
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78

5) Average waiting time of an arrival (worker) who waits.

E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
e) Briefly explain Monte Carlo simulation with suitable example.

2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F

14
20
60
10
D4
c) Write short note on special cases in Linear Programming Problem.

FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9

average service time (of tool room attendant) is 40 seconds. Determine

76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
Paper / Subject Code: 42862 / Operation Research (ILOC - I)

DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42

9
7
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4

18
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20

Supply
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420
Total: 80 marks

2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 F

(10)
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F

(10)
(05)
(05)
(05)
(05)

(10)
(05)

b) Workers come to tool store room to receive special tools (required by them) for

a) Solve the following by Vogel’s Approximation Method (VAM) and find optimal
accomplishing a particular project assigned to them. The average time between two
arrivals is 60 seconds and the arrivals are assumed to be in Poisson distribution. The
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 D
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB
EB D F F7 36 E6 62 C 20 F 6D
1T01427 - B.E (Mechanical Engineering) (SEM-VII)(Choice Base) / 42862 - Operation Research (ILOC - I)

BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7

1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7
9 C 6 E 0 7 8
 7C 6E E 2D C4 0F 7 DB 8 7E
6 9
C3 36E6 6E6 62D C42 20FF F76 DB 789 7EB BBD
6E E6 2D C4 0F 76 DB 789 7E BD 1F
36 6E 2 C 20 F7 D 78 7E BB 1 9F
E D 4 F B
6E 6E6 62D C4 20F F76 6DB 789 97E BBDD1F F9F7 7C3
6E 2D C4 20F F7 DB 78 7E BB 1 9F C 6E
6E 62D C4 20F F7 6DB 78 97E BB D1 F9F 7C 36E 6E6
6 9 F 3
E6 62D C42 20FF F76 DB 789 7EB BBDD1F 9F7 7C3 6E6 6E62 2DC
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42
62 C 20 F7 D 78 7 BB D1 9 7C 6E 6E 2D C4 0F
D 4 E F
2D C4 20F FF76 6DB B789 97E BB D1F F9F 7C3 36E 6E6 62D C42 20FF F76
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB

Q.4
C4 20F F7 6DB 78 97E BB D1 F9F 7C 36E 6E6 2D C42 0F F76 DB 789

78259
2 6 9 B D F 7 3 6 C F D 7 7
42 0FF F76DDB7 7897 7EB BD 1F9 9F7 C36 6E6 E62 2DC 420 0FF 76D B7 897 EB
0F 76 B 89 E B 1F F C3 E6 E6 DC 42 FF 76 B7 89 EB BD
20 F7 D 78 7E BB D1 9F 7C 6E E 2D 4 0F 7 DB 8 7E B 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
Daily
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
Demand

C5
C4
C3
C2
C1
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C

4-7
3-7
3-6
3-5
2-5
1-4
1-3
1-2
Arc
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF

Contractors
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
0

36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB

E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78
Probability 0.01

E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C

corresponding distance are:

9
9
9

10
10
R1
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
10

48,78,19,51,56,77,15,14,68,09

97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
the daily demand as given here:

0.20

EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D

8
2
9
5
1
7
8
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C

10
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF

Distance
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
20

2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB
a) Solve the following Assignment Problem.
0.15

C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD

15
12
18
17
14
R2

Rs.50 Lakhs is total cost of repair.

Page 2 of 3
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
Consider the following sequence of random numbers:

EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
30

BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C

7-9
6-9
5-9
5-8
0.50

1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420

Arc

D1F9F7C36E6E62DC420FF76DB7897EBB
9-11
8-11
7-10

10-11
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
average demand for this cake on the basis of simulated data.

36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB

E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78
21
18
21
20
19
R3

E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB

3) Which of the 5 contractors will be unsuccessful in his bid?

C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD
40

20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F

FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9

(10)
0.12

76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
Paper / Subject Code: 42862 / Operation Research (ILOC - I)

DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
Cost of Repairs (Rs.in Lakhs) of Roads

97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62

2
4
6
9
7

15
13
12
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC
50

1) Find the best way of assigning the repair work to the contractors and cost.
16
19
18
19
15

7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42
R4
0.02

Distance
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 F
2) If it is necessary to seek supplementary grants, then what should be the amount?

C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F

(10)

(10)
b) Iyengar Bakery keeps stock of a popular brand of cake. Previous experience indicates

Using this sequence simulate the demand for the next 10 days. Find out the stock situation
if the owner of the bakery decided to make 30 cakes every day. Also estimate the daily

table. Find the shortest path from node 1 to node 11 using dynamic programming. The
b) A distance network consists of eleven nodes which are distributed as shown in following

20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7

FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 D
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB
EB D F F7 36 E6 62 C 20 F 6D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7
9 C 6 E 0 7 8
 7C 6E E 2D C4 0F 7 DB 8 7E
6 9
C3 36E6 6E6 62D C42 20FF F76 DB 789 7EB BBD
6E E6 2D C4 0F 76 DB 789 7E BD 1F
36 6E 2 C 20 F7 D 78 7E BB 1 9F
E D 4 F B
6E 6E6 62D C4 20F F76 6DB 789 97E BBDD1F F9F7 7C3
6E 2D C4 20F F7 DB 78 7E BB 1 9F C 6E
6E 62D C4 20F F7 6DB 78 97E BB D1 F9F 7C 36E 6E6
6 9 F 3
E6 62D C42 20FF F76 DB 789 7EB BBDD1F 9F7 7C3 6E6 6E62 2DC
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42
62 C 20 F7 D 78 7 BB D1 9 7C 6E 6E 2D C4 0F
D 4 E F
2D C4 20F FF76 6DB B789 97E BB D1F F9F 7C3 36E 6E6 62D C42 20FF F76
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB

Q.6
Q.5
C4 20F F7 6DB 78 97E BB D1 F9F 7C 36E 6E6 2D C42 0F F76 DB 789

78259
2 6 9 B D F 7 3 6 C F D 7 7
42 0FF F76DDB7 7897 7EB BD 1F9 9F7 C36 6E6 E62 2DC 420 0FF 76D B7 897 EB
0F 76 B 89 E B 1F F C3 E6 E6 DC 42 FF 76 B7 89 EB BD
20 F7 D 78 7E BB D1 9F 7C 6E E 2D 4 0F 7 DB 8 7E B 1F

(10)
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6

Books
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D

Binding
Printing

time (hr)
time (hr)
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB

Where 𝑥1 , 𝑥2 ≥ 0
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78

of binding machine.
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97

80
30
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD

Subject to 3x1 + x2 = 3
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F
Maximize Z=𝟒𝒙𝟏 + 𝒙𝟐

4𝑥1 + 3𝑥2 ≥ 6
𝑥1 + 2𝑥2 ≤ 4
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9

Lot size

150-499
Upto 149
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3

500 or More
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6

2
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D

100
120
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
each player and the value of the game.

7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD

90
50

Page 3 of 3
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
b)Solve by Big-M or Charne’s Penalty Method

DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62 C
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC 420

D1F9F7C36E6E62DC420FF76DB7897EBB
4

60
20
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC 42 FF
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42 0F 76
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4 0F F76 DB
E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20 F7 D 78
E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420 FF 6D B7 97
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 FF 76 B 89 EB
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F 76 DB 789 7E BD
20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7 DB 78 7E BB 1F

Price

Rs.38
Rs.39
Rs.40
FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7 6D 78 97 BB D1 9
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6D B7 97 EB D F9 F7C
5

30
90
Paper / Subject Code: 42862 / Operation Research (ILOC - I)

DB 78 7E B 1 9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 3
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 DB 789 7E BD 1F 9F7 C3 6E6
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB 78 7E BB 1 9F C 6E E6
(10)

EB D F F7 36 E6 62 C 20 F 6D 7 97 B D F9 7C 36 6E 2D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7 897 EB BD 1F9 F7C 36 E6E 62
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7 897 EB BD 1F9 F7 36 E6E 62 DC
9F C3 6E E6 D 42 0F 76 B 89 EB BD 1F F7 C3 E6 6 DC
7C 6E 6E 2D C4 0F F7 DB 78 7E B 1 9F C3 6E E6 2D 42
36 6E 62 C 20 F7 6D 78 97E BB D1 F9F 7C 6E 6E 2D C4
6

10

E6 62 DC 42 FF 6D B7 97 B D F9 7C 36 6E 62 C 20
110

E6 D 42 0FF 76 B 89 EB BD 1F F7 3 E6 62 DC 420
2D C4 0F 76 DB 789 7E B 1F 9F C3 6E E6 D 42 F
C4 20F F7 DB 78 7E BB D1 9F 7C 6E 6E6 2D C42 0F

-----------------------------------------The End--------------------------------------------------------
(10)
(10)

a) A book binder has one printing press, one binding machine and the manuscript of
selects a coin without the knowledge of the others choice. If the sum of the coin is an odd
a) A and B play a game in which each has three coins a 5p,a 10p and 20p.Each player

b) Mini Computer Company purchases a component of which it has a steady usage of 1000

the component supplier agrees to offer price discounts of minimum lot supplies as per
for each book are given below. Determine the order in which book should be processed,

units per year. The ordering cost is Rs.50 per order. The estimated cost of money invested
number of different books. The time required to perform the printing and binding operation

in order to minimise the total time required to turn out all the books. Also find the idle time

policy and total cost of inventory system, including purchase cost of the components. If
amount, A wins B’s coin; if the sum is even, B wins A’s coin. Find the best strategy for

schedule given below, reassess the decision on optimal ordering policy and total cost.
is 25% per year. The unit cost of the component is Rs.40.Calculate the optimal ordering

20 F7 6D 78 97E BB D1 F9F 7C 36E 6E 2D C4 0F F7

FF 6D B7 97 B D F9 7 36 6E 62 C 20 F7
76 B 89 EB BD 1F F7 C3 E6 62 DC 42 FF 6
DB 78 7E B 1 9F C3 6E E6 D 42 0F 76
78 97E BB D1 F9F 7C 6E 6E6 2D C42 0F F76 D
97 BB D1 F9 7C 36 6E 2D C4 0F F7 DB
EB D F F7 36 E6 62 C 20 F 6D
BD 1F 9F7 C3 E6 E62 DC 42 FF 76D B7
1F 9F7 C3 6E6 E62 DC 42 0FF 76D B7
9 C 6 E 0 7 8