o+t19os+.

Code: ME 11714

NATIONAL INSTITUTE OF TECHNOLOGY, RAIPUR (C.G)

DEP,ARTMENT OF MECHANICAL ENGINEERING
B.Tech. (?th Sernester) Examination, Nov

Dec 20LL

Sub: C)peration Research

Time:3 hrs

Maximum Marks: 80

Note: Answer ANY FIVE questions. All questions carty equal marks. Normal distribution tables are allowed.

Q1. A local travel

agent is planning a chafter trip to a major sea resofi. The eight daylseven

night package includes the fare for round-trip travel, sruface transportation, board and lodging and selected tour options. The charter trip is restricted to 200 persons and past experience
indicates that there

will not be any problem for getting 200 persons. The problem for the travel
offer for

agent is to determine the number of Delu

this charter" These three plans differ according to seating and service for the flight, quality of
accornmodations, meal plans and tour options. The following table summarizes the estirnated

prices for the three packages and the corresponding expenses for the travel agent. The travel
agent has hired an aircraft for the flat fee of Rs. 2, 00,000 for the entire trip.

Tour Plan

Prices and costs for tour packages per person Prices (Rs.)

Hotel costs (Rs.)

3,000

Meals & other expenses (Rs.)

Deluxe
Standard

10,000
7,0Cr0

4,754
2,500

2,200
1,900

Economy

6,500

2,240

In planning the trip, the following considerations must be taken into account:

(i)
(ii)

At least 10 % of the packages must be deluxe type.

At least 35 % but not more than 70 %o must be of the standard type. At least 30 o/o must be of the economy type.

(ii|

(iv) The maximum number of deluxe packages available in any airuaft is restricted to 60. (v) The hotel desires that at least 120 of the tourists should be on the deluxe and standard
packages together.

The travel agent wishes to determine the number of packages to olfer in each type so as to

Page

lof4

maximize the total profit.

(a) Formulate the above as a linear programming problem. (b) Restate the above linear programming problem in terms of two decision variable taking
advantage of the fact that 200 packages

will

be sold.

(c) Find the optimum soiution using graphical method for the restated linear programming
problem and interpret results.

Q2. Solve the following L.P. problem by simplex method: Minimize Z = xr- 3x2 + lxr,
.subject

to

3xt

2xt+
Xto X2,

4xz
x: )

- xz + 2xt = 7 ,
> -72,

- 4x1 + 3x2 + 8x3

0.

< 10,

g{

ni"a the optimum solution to the following transportation problem in which the cells
contain the transportation cost in rupees'
F1

Wr 7
8

Wz

Wt
4 6 9

LYd

Ws

Available

6 5

9
8
5

Fz

Ft
Fq

6
5

I
7

7 6
8

.30

40
2A

7
15

6
5

l0
100 (Toral)

Required

30

30

20

Q4. Solve the following assignment problem:

I
1

il
l7
.| 16

UI
8

IV
t6
6 12

f/ v

11

20
15

",

9
13

t2
15

16

4 5

2l
t4

24
10

l7
t2

28
11

26
13

Q5. Arrival rate of telephone calls at a telephone booth are according to Poisson dislribtrtion, with an average time of 9 rninutes between two consecutive arrivals. The length of
telephone call is assumed to be exponentially distributed, with mean 3 minutes.

(a) Detennine the probability that aperson arriving at the booth will have to wait. (b) Find the average queue length that is formed from time to time.

Page 2of 4

6Q*csvrtJ

AloY-DGC- >6tI

(c) The telephone company will install a second booth when convinced that an arrival would
expect to have to wait at least four minutes for the phone. Find the increase in flou'rate

of arrivals which will justify a second booth.

(d) What is the probability that an arrival will have to wait for more than 10 minutes before
the phone is free?

(e) What is the probability that he will have to wait for more than 10 minutes before the
phone is available and the call is also complete?

(fl Find the fraction

of

a day that the phone

will

be in use.

gffi

civil engineering firm has to bid or the construction of a dam. The activities and their time
estimates are given belor.v:

Activity
Optimistic tirne Most likely time Pessimistic time

t-2

2-3
T4

2-4
13

2-8
16

-A J-+

3-5
15

4-6
LJ
ta

5-7
0

5-9
14

6-7
0

6-8
0

7-9

8-9
14

l4
t7
25

t6
20

18

i5
18

t9
28

18

T7

18

16

21

27

21

20

4I

22

The policy of the firm with respect to submitting bids is to bid the minimum amount that

will provide a95sA of probability of at best breaking-even. The fixed costs for the proiect
are eight lakhs and the variable costs are 9,000 every day spent working on the project. The

duration is in days and the costs are in rupees. What amount should the firm bid under this policy? (Calculations on time should be performed upto two decimal placesJ.

payoff matrix is given below: QZ-Solve the following garne whose

Player Player B
B1 4

A
A1

82
2
J
3
a

B3
0

B4
2
J
a

B5

B6
1

i
2

A2
AJ

4
4

I
4
J

2 2 2 2

-5 I
.)

I
2

A4 A5

4 4

J
a

Page

3of4

Q8,

company manufactures around 200 mopeds. Depending upon the availability of raw materials and other conditions, the daily production has been varying from 196 mopeds to 204 mopeds, whose probability distribution is as given below: Production/day Probability

The finished mopeds are transported in a specially designed three-storeyed logy that can accommodate only 200 rnopeds. Using the following 15 random numbers g2, gg, :lg, 24, 53 ,

6l,

8, 4,5,,,04, 23, 50, 77, 27,

54

and,

I0, simulate the process to find out:

(j) (ii)

what will be the average number of moppds rvaiting in the faclory?

What

will

be the number of empty spaces in the lorry?

Page 4of 4

Lt9 31 9 t 1" (,:

Code: ME 10714

NATIONAL TNSTITUTn OF TECHNOLOGY, RAIPUR (C.G)

DEPARTMENT OF MECHANICAL ENGINEEzuNG
B.Tech. (7th semester) Examination Nov - Dec 2010
Subject: Operations Research

Time: 3 hrs.

Maximum marks: 80

Note: Answer ANY FIVE questions. All questions carry equal marks. Normal distributian
tables are allowed.

Qt. A manufacturer

produces two different models * X and Y * of the same product. Model X makes a contribution of Rs 50 per unit and model Y, Rs 30 per unit, towards total profit. Raw materials rl and ftalf,E required for production. At least 18 kg of 11 and 12 kg or 12 must be used daily. Also at most 34 hours of labour are to be utilized. A quantity of 2 kg of rr is needed for model X and 1 kg of rr for model Y. For each of X and Y, 1 kg of 12 is required. it takes 3 hours to mariufacture model X and 2 hours to manufactue model Y. Formulate the LPP and determine how many units of each model should be produced. (Use graphical method)

Q2.

Solve the following LPP using

Big-M method.

Minimize Z:3P + 8C
Subjectedto

P+C:200
P<80,C>60

And PZ0, C>0

Q3.

Find the optimum solution to the following transportation problern in which the cells contain the transportation cost in rupees.
W1

FI
F2 F3 F4 Reauired

W2 6
5

W3 4 6 9

W4
5

W5 9

I
6
5

I
5

Available 40 30
2A

8 1

6
8

7
15

6
5

l0

30

30

20

F"p tdb 3

Q4,

Four wagons are available at stations A, B, C and D. These are required at five stations P, Q, R, S and T. The mileages between various stations are given by the table below. How should tlre wagons be transported so as to minimize the total
mileage covered?

.;+"N w-f
P
A
10

o
16

.s 18

t2
20
JL 10

d^

.*
Q5. ,+

B C

24 30

22
28

25 JZ
T4

26 34

t5

t2

l6

In a large maintenance department, fitters draw parts from the parts-stores which is at present staffed by one storeman. The maintenance foreman is concerned about the time spent by fitters getting parts and wants to know if the employment of a stores
labourer would be worthwhile. On investigation it is found that

a) A single queue situation exists b) Fitters cost Rs. 2.50 per hour, c) The storeman costs Rs. 2 per hour and can deal, on average, with l0 fitters per
hour,

d) A labour could be employed at Rs. 1.75 per hour and would increase the service e)
Q6.

capacity of the stores to 12 per hour, On average 8 fitters visit the stores each hour.

A civil engineering frm has to bid for the construction of a dam. The activity details
are given below.

Activity
Predecessors

B A

E B

G E

H
E,F

I
D,F

B,C

Optimistic t4 t4 13 16 l5 14 13 l6 t4 time Most likely 17 18 15 t9 18 t7 20 18 16 Time Pessimistic 25 2I 18 28 27 2t 20 41 22 time The policy of the firm with respect to submitting bids is to bid the minimum amount that will provide a95o/o of probability of at best breaking-even. The fixed costs for the project are 8 lakhs and the variable costs are 9,000 every day. Duration is in days and the costs are in rupees. What amount should the firm bid under this policy? (Calculations on tirne should be performed up to tow decimal places).

Pory Z -'b 3

Q7.

Solve the game whose payoffmatrix is given below: Player A Player B

B1
J J
a

B2
2

AI
A2 A3 A4

B3 4
2

B4
0

4
2 4

4
0
8

4
0

,.Q8. A bakery keeps stock of a popular brand of cake. Daily demand based on past
experience is given below.

Daily demand )5 0 15 Probabilitv 0.01 0.15 0.20 Consider the following sequence of random numbers:
48, 79, 09, 51, 56, 77, 15, 14, 69 and 09.

35

45

50

0.50

0.r2

4.02

(i) (it)

using the sequence, sirnulate the demand for the next l0 days. Find the stock situation if the owner of the bakery decides to make 35 cakes
every day.

Also estimate the daily average demand for the cakes on the basis of the simulated
data.

P""fr 3

db 3

CSVTU

Code: ME 09714 B. Tech. (Seventh Semester) Examination Nov-Dec,2009 Subject: Operations Research

BRANCH: MECHANICAL ENGINEERING

Time: Three Hours Max Marks: 80 Min Marks: 28

Note:

1) Attempt

all questions.

2) All parts of each question should be answered together.

1 (A)

!P) '

Whereas

Old hens can be brought at Rs.2 each and young one at Rs 5 each. The old hens lay 3 eggs per week and young one lay 5 eggs per week, each egg being worth 30 paise .A hen costs Rs 1 per week to feed. Mr. Amit has only Rs 80to spend for hens .how many of each kind should Mr. Amit buy to give a profit of at least Rs 6 per week. Assuming that Mr. Amit cannot have more than 20 hens. Formulate its LPP. Solve the following by Simplex method. Max Z:l5xr + 45xz Subiectto x1 * 16x2 <- 240 5x1 + 2x2 <= 162 x2 <: 50
Xr

05

10+5

axz ):

i) Find the optimal solution to the Lpp. ii) Discuss the effect of changing availability from (240,1 Gp50) to {250,150,52)

(C)

OR
Solve the following by Simplex method, and also comment on its result.

l2+3

Max.
Subject

Z:4xy

to

* x2 1: 50 xt*2xz)=80 3xt+2xz>:140
X1

3xz

x1

,x2

>:

Solve any Two Parts Fine jobs are to be processed and fine machines are available. Any machine can

.esIE 40 36

10

A
I
Jobs
2
a )

B
38

C
4A

D
28
21

32 40
41

24

28
JJ
41

27
38

22

30 36
35

)t

.22

?q:

36i

(B)

Prachi Airlines that operates severl days a week has a timetable shown below. Crew must have a minimum layover of 6 hours between flights. Obtain the pairing of flights that minimizes layover times away from home for any given ver. fesults m wr DE irins the crew will oe based at the city that resrilts in the smaller I
Flight No.

10

2
J

7AM 9AM

Chennai Depart

Mumbai

Flight No.
101

Mumbai
Denart

Chennai

9AM
I

Arrival

9AM
8PM

arrival

11 AM
12

AM

t02
103

IO AM

NOON

l:30 PM
7:30 PM

3:30 PM 9:30 PM

3:30 PM

104

5:30 PM IO PM

(c)

National Oil Co. has 3 refineries and & 4 depots. Transportation cost per ton & v9n ulremen ts are siven below:
Dr
Pr
5

10

P,
P"

Dz 7 6
10

D3

D4

l3
14

l0
l3
l1 400

Caoacitv 700 400

800

t2
300

uirement

600

100

Determine optimal allocation of output using Vogals approximation method and check the result by Modified distribution method.

(A)

Define Traffic intensity or utilization rate and idle rate. At a cycle repair shop on an average a customer arrives every five minutes and on an average the service time is 4 minutes per customer. Find Traffic intensity, Idle time, and number of customers in system and queue length. Construct A Network & Find The Minimum Time Required For The Completion Of,The Task. Also Find Lst, Lft, Est, Eft A<D,E; B,D<F; C<G; B,D<H; F,G<I. Timc Taken A:23 Days B:8 Days C:20 Days D:i6 Days E:24Days F:18 Days
15

(B)

G:l9days H:4 Days I:10 Days

OR

(c)

rlu Draw the network for followins oroi w Preceded By Activitv

a

15
Duration (Weeks)

l0
a a

b
c d
e

b b
c c

9 7 6

t2
6
8 8

f
o

f
d

g,h

ll
5

e
I

NOV'D%" zoo9

(A)
(B)

Solve anY Two Parts What is bimulation? What are the steps involved in simulation? Discuss Monte Carlo Simulation'

10

Brite bakery keeps stock of a popular brand of cake. Privious experience

ndicates the da lv demand as given here. 30 l0 20 0 Dailv Demand
Probability
0.01

10

0.20

0.1 5

0.50

40 0.12

50

0.02

Consider the following R.No 48,78,19,5 1,5 6,7 7,1 5,I 4,68,09 Using this sequence, calculate the demand for next 10 days' Find the stock situation if the owner of the bakery decides to make 30 cakes every day. Also estimate dauly avercge demand for cake s on the basis of simulated data'

sequence of random numbers'

(c)

Define Game value, Saddle point with relevant example' Usins Dominance principle. Solve for probability o{rglggtiqg
Br
B2

10

rlglg

s.
Ba 05

Br
25

Ar
Firm A
Az

35

6s

30

20,
50

l5
00

00

Ar
Aa

40
55

l0
15

60

l0

csyru
. .. r_._ B.Tech. Seventh Semester Examination April'2009 (Mechanical Engineering Branch)
OPERATIONS RESEARCH
Time: 3 Hours Max Marks Min Pass Marks
: g0
:ZB

, ..

ode

No. M E

ab7l4
i

Note: Attempt all the questions. All

place in the answer copy.

parts of a question should be attempted in continuation at

The simplex table for a maximization problem of linear programming is given belou,:

C;
,5

Easis
51.,

ttt ,AI

X2
I
I

S1
I I

S2 0 0 0 0

b;

r0
-)

LI
Ci-Zi
Here,

4
5

)
5

0 5

-l

-5

Xl &.X2

are ijec!sion variatllesand

Sl & 52 are slackvariables. Answeithe fblloii,ins

questions, giving reasons irr brief:

(i)'
(ii)(rrr)

Is this solLition

optimum?

---------------(2)

Are there more than one optinial solution? -------------(2)

(iv)
(u)

degenerate? is this solution feasible?

Is this solr:tion

----------------(2) ------(2)

If Sl is slack in machine A and 52 is slack in machine B, which of these

machines is being used to the solution?

full capaeity when producing aecording to this

of produet

(vi)

A customer would like to

elcess

have one unit

Xl

and is willing to pay in

TD

of normal price in order to get it. How much sllould the price be increased in order to ensure no reduction of profits? -------------(4) Machine A (associated with slack Sl, in hrs./week; has to be shuf down for
repairs for 2 hours next week. What will be the effect on

profit? --------(4)
?7-o

Part (a) is compulsory. Attempt one more part from the remairiing.
(a)

(i,)-- Name
(iD
\

any two methods used to determine starting solution

of

Transportation

Problem

--------(2)

It is necessary that
State true or

Assignment Matrix must always be a Square Matrix.

.....
.t

false.

----------(l)

(nr)

when does a transportation problem have a unique solution? state in one

sentence.
Four new machines

---------(2)

,'&{" '-.oh

d1*6
0

Ml, M2, M3 & M4 are to be installed in a machine shop. There are five vacant places A,B,C,D & E. Because of limited space, machine M2 can not be placed at C and machine M3 can not be placed at A Assignment costs are tabulated
be

low:
A M1 M2 M3 M4
4

---( I 5) E
(t

D
5
c J

E
6
4
L

t0
9 7

4 6
3

* r'x

-{4
9

6 2

Find optimal assignment sehedule

(c)

A company is manufaeturing air-coolers

has trvo plants locaied at Bombay and Caicutta

with a capacity of 20C units and 100 units per week respectively. T'he companl,supplies
the air-coolers to its four siroivrooms situated at Ranchi. Delhi, Lucknow and Kanpur. lvhich has maximum demand of 75,100,100 and 30 units respectively. Profit per unit
tabulated
is

below.
Rancla!

-----(l5)
Delhi
90 70

Lucknow
r00
130

Kannun

Eonsbav Calcutta

90 50

il0
B5

Plan the production program so as to maximize the profit. The company may have its production capacity at both plants partly or wholly unused.

-l

(a) anr*r.

following each of I mark. 1X5

-5

marks.

PTO

ftP

F*

z'e-c'

LSvTL)

I
\

G),

(ttr

Saddle Point is the point of intersection of pure strategies. True or False? A pure strategy game is one in which each player has only one optimal strategy.
False.

True or

-\tiiit J.. . / ltv) (v)

(b)

When do you say that game is stable?

Define value of game. When do players apply mixed strategy? Apply when there is no saddle point.

A small retailer

has studied the weekly receipts and payments over the past 200 weeks

and has developed the

following set of information.

---------

------( I 5) Probability
0.30 0.40 0.20 0.10
aird

ps
3000 5000 7000 r 2000 0.20 0.30 0.40
0.

Weekly payments 4000 6000 8000 1 0000

l0

Using follorving set of random nuntbers, simulate the rveekly pattern of receipts
payments for

l2

weeks. Assuming that beginning bank balance is Rs. 8000, u,hat is the

estimated balance at the end durins the ouarter? a+3

R-andom Nos.

of l2 weekly

periods? What is the highest weekly balance

Fo r rece i pt s : Q3,,, !. I, l-B-5 5, I 7.4

6,3243,69*7 2,2 4,ZZ

For Fayments: 5 1,963A 32,A3,88,48, 28,88, 18,7 1,99

(a)

Solve either part (a) or (b) A small maintenance project consist of the following jcbs wliose preeedence relatir:nship is given trelow: 1-2 t5
1-3

Jotr Duratiom (Davsi

2-3
3

2-5
5

3-4
8

3-6

4-5

4-6

5-5
3

tj14

l5

t2

l4

: (i) ( (ii)
lo

Draw an arrow diagram representing the project. Find the total float for each activity. Find critical path and total project duration.

(iii) (b)

OR
Solve Soth (i) and

(ii)

.,Y: T'-(

(i) (ii)

Explain Kendall's

notation.

----------------(5)

Customers arrive at a one window drive in bank accoding to Poisson distribution

with mean l0 per hour. Service time per customer is exponential with mean 5 minutes.
The space in front of the window including that for the serviced car can accommodate a

maximum

of 3

cars.. Others san

wait outside the

space.

-------------(15)

r
e

What is the probability that an arriving customer can drive directly to the space in front of window. What is the probability that an aniving customer
space.

will

have to wait outside the indicated

How long is an arriving customer expected to wait before starting service?

,a' ,l

('l

- 1,^,r'
-)
\.i

(r

Code No' ME08?14

C5

VTU
B"Teeh' Seventh SemesterU:uryYlon Branch) (MechanicJ fnginoe'ring

Nov-Dec 2oo8 I\\'r .-"- - -

'

**"nj?Yfr,J#ffiu"o*
Time: 3

Hours
arl tlee questions.

Max

Marku t :28 19 ffiPass Marks

the'
'

Note: Attempt

A*

at one plaee of should be attempted parts of a question

, ,-*rT:":"oll***,*r,* /
-X
/
What isthe

15 from the two sentences) anv

r'i5 rnarks) foilowing' ----'xtr5=

solution? and Basic feasible betwee: n Basic solution difference

soive

.")4Definer:.rn";':,mr;:,?1$'fi?rcatetha1,!1r,?Phasunboundedsolution? ro methocr nor be used Iesluuqrv "' \'/>i Why the transportatron '

Wffi:1fi::.frq:l'"li#r**:*#T'JJili#
, X(

"ut ett:ignment problern? on the oritical path of a projeot network? C*-u durnmv activitv'appearr:il;"fil;, tt'z*'o?

W, What is - lx.
X' "X{ xJr.
what

t';;t"ing m:l ffiff^$J:?;i?i'lTJ theory? ir'

1;

even'[s?

What is *xPielsivc s1-ater Whenis gen:e iriir?

having 4 transportation p'obienr variabres in balanced non basic tn t?* ,o,r*uer of

'il;"*

Q1euins

"'7, . '"*1",,* 5 eulun"lns' ,,-1 to every cost element in the transportation tmffif;,;i;?;Jli,l"tl#;ii;h""se'.is iitnre or rarse'

problenr table'

tr'(:
\./

w,/ XIV'

we aJJ

"r-

subtraot *

'"**;1'1."";H#;ffi
cost rnatrix, rhen

fr; af eiements of a row or co ""#;*t ;'ilH"i"?tffi '-;il"'dJ:f S;;'J":T;*"crassignment

trs

- rumn or assignment

opri*.r* iuil" *iir u* alter.e$.

it true or false?

j;;i;:'.

;Nr.*n*'l'l''i*#;i"b'bliwfii'iu*ionusedinPERr? ;;-'h *oai in Queuins theory? what

Xvr.

rvi,;" ':]]ffi

il;" *

tn"

a salne is stable?

t;f

form of assignment Give linear prc$alnming

problem

'---(5)

V-TC

2Pafi(a)iscornpulsory.AttemptC}neff}orepartftomtheremaining.
and comment on obtainecl sclution Solve ttrliowing LPP using Eig M rnethod

(if any)

,.16'

MaxZ=A1"l+jxz
Sub. To

Xi+X2 d

50 x1+2X2>/ 80

3Xr+2X2>148 XL,Nz ?A

(b)

floilk production of 6 rrritrlion triters and 9 A dairy firm has two milk plants with daily n!1 ttt" needs of three dis*ibution miltion lit"rs'r[ieolir"iv. bacn dav fit* ryu* l..s and 3 million liters respeotivetry' cost of centers with milk requirement ii gf*t P *.utl distribution center is given in shipping t *iition liier from *utn ;;;;; below. ronnuiate'LPP involving only two decision variables to hr:ndreds ----------(8) "f coast'

minimize transportation

Oistribution Cenlgll

daily requiremnts 6f nursing A haspitai administrator iras the tbtrlorn'ing rninimal

personnel.

"-,---"-(8)

Period

Clock

Tire

Minimal No'.gf Nurses Requirssi

66

).
A
2
A a

6AfuT-1OAM 10Ah4-2 PM

7A'
60'
.-

2PM-6PM 6PM-10PIyIlOPIVT-zAM-

5024, 30'

2AM-6AM

period and work for 8 Nurses repod to the hospital wards at tho beginning of each no. of nr.lrses to empioy eonsecutive hours. The hospital wants tcrn rleterrnine minimum for eaeh period' Only so that there will be sufflcient no. of nursing personnel available formulate this as a LFF.

UA'J {'

N 6V*D Gc*zoaY

'-sJrr)

_i

Fart {a) is oompulsor-v". Soive any one from remaining two parts.

(a)
dt--''

A caterer undertakes to organize special dinner for a week and decides that he will
need a suppiy
each. He ean also washing. A laurldry provides regular service for Rs. ::i per use soiled napkins a{ler napkin and retumls the napkin after two days" There is also aq express scrvice e"t Rs. 10 in whicil naptr<in is made available next day. The caterer will need 300, 600 250, 30A,275 and 45S napkins from Monday to Saturday respectiveiy. Deterrnine how he should buy and send for laundering so as to niinimize total cost. ---------------(10)

of fiesh napkins daily. A new napkin costs Rs. 20/-

(b)

A firrn produeing a single product

has 3 plants and 4 customers. Three plants produce

30,50,40 r.l;rits respectively. The co. has committed to supply 25 units to customer 1, 20 units tc *us'ioiner 3 and at least 10 units to customer 2" Both customer 2 & 4 are willing tr- p*t any ntrmber of units frorn the co. 'fhe profit associated is shown in the (10) table beio'w. Workout the optirnal distribution pattem.

CustoroerSP Piants Y
1

)
t6 t7
27

2
J
a

2l l7
32

25
15

l8
20 30

l8

/^ (cX \./
(i)
(ii)

Five mechanics are availabie to work on five rnaehines; the respective cost of man machine eorurbination is given below. A sixth rnachine is available to replace one of the existing imachivres and associated costs are given below. Detemine: -*-------(10)
Whetleer ner i rna*hine can be accepted? If,yes then which one shouid be lepiaced? The optimax assignment and associated costs
MacEaime

I
t9
13
15

4
16

5
13

Frleehanic
A

t5

B C

t{
t9 t6

22

2l
20

t4
18 15

*
t'i n

20

))

l7

t2
17 18

t6

l4

l8 t9

Part (a) is cornpulsory. Attempt one more part from the remaining.

\./

@{

Explain Kendail's notation

The whetlier at a particular location satisfies the following description.

(b)

The probability of rain tomonow is 0.6 if it is raining today. The probability of its being clear (no rain) tomorrow is 0.8 if it is clear today. Using following random

?trt

nurxlbers sirnulate evolution

duy.
0.3CI" r].03,

of weather for 10 days, begiruring with a day after clear

*----(15)

0.38, 0.60, 0.22, A.42, CI.37, {}.79, 0.23' 0.01

(c/ ,/' .A, oroiect consists of series of tasks A,B, .".. H, I with the following relationships. (W<X,Y means X & Y cannot qtart until W,is fi1ished. X, Y<W means W cannot ,,/ " start until both X & Y have, finished") With these not4tions, construct network d-iagrarn having following constraints. ------------(15)
A<D,H; B,il<F; C<G; B,D,G<FI; F,G < {
Identify critical path and also find minimum time of cornpletion of project when the time in days of completion of each task is as follows:

,qBCDEFGHI 20 L6 24 23 I

l"E 19 4

10

Llode l.Jo.

(, t,'1 e Z LS

B.Tech. Seventh senrester Examination, Nov.' 2008 (N{echaniczrl Engineering Btanch) AICTE Scheme

OPERATIONS RESEAI{CT{
Tiure: 3 Houls

Max iWarks Min Pass Marks

: 100
:l
-5

Note: Attempt all tiie questions. All

place in answer copy.

parts of a question shoulcl be atte'rpteci in continuation at a

Part (a) is compulsory. Attempt one more pari from the remaining.

(a)

Explain tlie following tenns giving suitable example and physical significance. (any tt'") -------(15)

&/rtificiai Variable -{ Redundant Constraint

-/Deger,trracy in Lpp ,gr"-'Selsiti vity A nalysis
,Si
;.,;, iliic ;

:.,:

l,

(b)

Us;e Sinrplex
N4ax s.1o.

method io sioive:

(1

0)

Z:6Xl i

4X2

2X1+3a25 39 3X1+2X2<24 x I Fx2>-i x1, x2>0

Find alternate soiution (if any).

(c)

Solve by Big Nf rnerhocl"

l"iirr

Z- i?,i i ij;i2

Subjeci

1o:

2X I +5X2> I 50

3Xt+X2>120 x1, x2>0

P;

i,

)-

.{$''""":1

i'ait i.r; is ctltitpulsol'1r. r\'uo-',rpt olto mole Il:trt fi'or1 the reuraiui'g

;@f-I'r'ipti Aillines that operates seven days a rveek has the tirnetable given belon,. Llrew mi,rst have a nrinirnunt lal,over of 6 hours between flights. Obtain the paring o1'llights that minimizes layover- tirne away from honie. For any given paring the crerv u,ili be bascd at the city tliat results in srnaller layover. For each pair also mention the citl' where crerv should be base$. ------:-----Flight No.
I
2
n
-)

Chennai Denarturc

Munrb*i

Flight No.

Arrival
9 anr

Mumbai Ilenarture
9 arn i0 am 3.30 pm

Cheirnai

7am., 9am
.1.30 am

Arrival
11 am i2 noon 5.30 pm l0 prn

ll

t0t
102
103

am

7,30 pr:i

3.30 prn 9.30

104

8pm

There are four factolies and three sales depot. Profit associatecl for transporling one unit is indicated in the table below. Determine the optimal transportation. ---l---------1ro;

To

lt

S1

S2
o

s3

Capacity

l.D

.--4
2
3

t0
150 50 100
I

Il2
F3

-)
?

ll

120

tl

lsc

(cy/ A Ccuri;any has a team of fbur saleslnen and there are four districts r,vhele 1lie company .:,.Jhr 1i'''11{s to starl L'usiness.'l"he co. eslinraies that profit per day, i1-r rullees foe each salesmen -\ tpin caclt iiisii'it,ri is as 1bllorvs. Irincl the allocation of saiesinen to various clistricts to OJ" -----------(10) rnaxirriize thc plofii
. I

A
T1

!j

t+

1( tJ

f) 3,t Part (a) is oompulsory. Attempt

(a)

i5 t2
()ne morrr part from the remaining.

(irve trvo practical examples o1 each rf the following situation. ---,---(10) il:-iiii arrivai .'' sirrgie server !nfirritc Sev,-'i Last come lirst serve. Arrival from llnite popuialion

r) i- :ij,

L_

F,

Ft

6t/ * Lbo I NLCTE

(b)

owii:i cl'a cir:rir oj' jagi 1b,lci re sta rr.ant is consi,:iciirrg a ltcw conrprutt:r ,sysl.em fbr accounting anc-i inveri,.;);-r/ .:01!t1.ol. A cc;nl;uter coutpany ,",,t tlic filloriing inibrmation about the systern instailaricu.------------___(15)
Activity Activiry Ii Descriptiori
Pess int ist

'1.'irr:

ic

A
B

S"t.t
.

Design Int Desigir ltl

lr

Alsel&lu laldrvare j
Develor-r

-evs1

-F

B
l)

25
18
I

Devuicp lrrp

q
II
I

(i) (i i)

Construct alt aric\,\, diagrarn ibl.th" pr;G;. -Ddter'rine criiir:.,r path a'cr ."1r...'r,i project col,preticn time,

p-ffi*'j-iiffi
Test &. in

rorrtilnc roul I _ Create Dl __Sryq! pli;bise-l _f_ r*jr S Install L*

_l___ ^_

'::)"

A repairmall is to be itrrctl to ''c|art'lnachines that breakilorl'n lollorving a iloiss{rr.i rvitlt a'averaile Latc o1'lour lrci'lLour. fhe cosr of non-p.oa.,"i;;;|..];;,r*"iu jrrocess mu. I n.,. hour- f'he colllpaily iias iirc opl;on olchcc:;ing eithel'r r"r, ol a s:loq, rcpair'ra'" .1.5e fhst repainlan charges I{s. 6 per hcur and u'ill repair machinel; at aii arrerage rate .i. 7 per hour' T'he sior'v i'epairntatr charges Rs. 3 pel hour and u,ill repaii' machines a-t an a'erage rate of 5 i:rcl i:oui. \x/irich rci1;i:-it-:riir shcrilrj !.-e }:i,,::C.i -_ _---ai5)
Part (a) is cornprrisory. Alieiltj)1,

__;_

luc

urcre lrari fi-om..he rernaining.

(a)
7.,

wrjtc iri blielabriu: iir tcilo.,vill

-1.

."-

__(10)

@/r
6
(c)

l.

/,\,, l-l ti 5 lL-/\ ' seuclo I{and,;r:r idui'r ,c'i' lt- imitatior, ui Sinl rl::l i, :;; 'l'cciriiitluc r,v(; Persorr lel,,_' Srit;t i ir,trrc
FiLttl

g:" L r--te_J-L, t gt-rfl., v luZ. ' ir1 p yaL+---------(1 s)

llrc r alu';

of il
/

- -t-

t)

irv ,
,r'

,r-lrcii^i' liN fl"o'r the enclosed table and :;iurilla.iing 20 timcs

Deilnc followilig lcrntr, iir casc of {iamr: theory;

n

\, Piaycl
\ Strategv \-_ _ii.'uff Sti.ates! u., ,
itvi;*ea strrl"gy |Rectangular Carrrcs

" r
:i
1:
,l.---

" " y

"

/eaycff Saddlelloijtt

-iI

(,i

ji :.rrrjlrin

a r!,1.!. ( .1 .fable N rrlr bei-s

34e3e6es25 02t?112ry? j2e20544t>6 0j0001462e 43e14261)7 e89l9ll:g 3E07e505'e est:gqiis

;Jfiit;:; 5o::ll!ls" 2zr,:t.lyt liis\siiu'r1;;;,u;i ;e;e;ir6i llrnrurno, ,4e420382 ,r83:g1ggl2 er031610i1 ?4r36865ee loiossiess s43zr ii6i0 duuoonr,rn, 0764238ei4 1669:?7?s,? ligiiiilc, u4r42e44jo e:
iia\6ili r,z ;ii3il;d;,ri1?;Z!;:tr oisiresila ggss6sssZ| il.ooru*r,, itZgiisitg iloBil;ffi ,uirorr.rno qc\iiiiiis stzzsiliTz iriio'tt6io rsliozissX ioztstqsoi r!,uurrr,,
?y3_7el:t16 so,r:ros+q

?'181e22te6 20i19l]i9s4 c,?62130tr,t -rrj r r28r05582 72t)sat,t5. ) q:oiir iis: 837485601q ,i j7657422 71i2071:;s6 t!ia,;.,.i.:1i.;,,tAzit;isZ );,.;;;;;; gf:igiign; d55747?,.68 4ree52r,r58 30?,1?1lqs?2 s;aesie,, i2ei/6s.rja ) 3s4s174t40 ;A?liil;;j sitaiigirs
'

ooiigii66i ilrrrrrro, 6;;;i;;;;; y:??:?rOd iitsezzs,z iiaiiz\i6i s7eeeelt8:. 0r3s:g!:3e )e;;;;ii;; 442s14318s :iioos:zss rssro:ii03 jdl,rru,r,o
B-s0877ren 40355s+32r 6r)7002458ti s3241326s6

;;e';;;;i;; ;il;;liiiX rr},rroorou, ;,r.;o;;;; ;;;6;;;;;; ;i;gfi;f;s 751s11628,1 en2g:1]1s \iiiliiiiq

05eo{s344:r anorpsq'ia e5665543i{ 5585:g:11:

l;fi'fffi:

;il3ijiSlS

;*njj:1

112:i1;i!i iir,i{:!e)i riisq6r;:z<c q1i055505'' 47651llbil n,.;.itli.li t ji?il;;: 515st1t,d-.,l:;,,;;,;; tJEr675b-j9 8907:ybn97 s,,uoszszo ,i'u,,n,.,, ;:;i,3il!3

:i?;?t?lt{

trjjtjfjtj

;l#;;fffi

iit,*,,,,,

#,;;iilj ;i;i:t'i*) diifiiijl :ns,i;;; ?#t:,z,]tri ltliiiitii iiiii,#ii! fitririiri iwf;;

t;i;il?;y,i
=,!,i'::?,li?,1 l'=;1tr1, i;?:S ir ' ;. ;,;,,;:1jl .. ;;ii',;;i;li,'' i;ri,r-;ur; r9.- trlIS I L)jt,.r,,1 ,1tfi61;i "'l i /5r,:,5JJ lnl.lI'rr',1,: :,.r]lr;i.i, ll;lj007s] ri,() rlJ.,J--1 orEjBT-Zlr7 :ournu.O:C -i471561,]2:\ -tj,14()j j4,n rlr;.il.ts:; t1i,,,ii:tirq 857,|:6?n9? 2i\094s6-/61 jsot;rr*iil ::oe.16iogt i.in*ur,,n,, ri6i122at1 0146s808e2 sil:,,iaii;i E22-1980i42 -iz:SO:rS:: g]jl:rqe&e (.1 rx5tBr)7ii 3rLt!()c UQrrT ili:']Sr:lq {Jg,9{Fjj30 szo+.r,"rosc 2roi>ijrrOt rij:j4 i8230s 6?a j4763e.:, iqi;it:tair; lit94'1.2-l'/.2 ?.c],1.1'.:'l:tr.ti f;.,,l.,,tiili:i 3-i4j2s0te5 :eq+ci-:6ss {;ii)74}7},1}i oct-)(;.t-i-l-tlr, :Zl,91,i9i.,:; l{,1t20l0gt 60,?.112145 .Ji9-igg4.24(t
g?.24i2g9rR

l#iij;'lii l;;; ll::i

:r; ryiii;: i;li6ii'tti iiff

U;;lllX

AICTI.:
B.'fech. Seventh Senrester l:xarnination Apr.il,0g (Mechanical Lingineering Branch) I'1,'),

ccrcle

No c'J/021--\

OPI'RATI OT{S RESI,ARCH

Tinte: 3 Hours Max N4arks Min Pass h4arks

: 100
:35

Note: Attenipt all the questions' All parts of a qlrestion should place ir the answel.copy.

be atter'ptcd rrr continuation at a v(v\r in

Part (a) is cornpulsory.

Atle'rpt

one nror-e par.r ri.urn rrre r.enrairing.

(a)

Explain the following terms giving suitable example antl physical significance. (any five) -----(15) Siack variable SurplLrs Variable -\qr. Redundant Constrainl -.*(\\ Degeneracy in LIip >{ (= j >J Sensitivity Arralysis () Feasible region E Canonical lorm of constraints
Soive iiriiorving Uy graphicai nretliocl, incijcate tbasible region arrd inciicale Reciundanf constraint, if an1,. -__-____--(10)

MinZ,:3Xi+

5X2
1)

S.to.: -3Xl+4X2{

2X1+3X2> t2 2X1-XZ: -2 xl< 4. X2> 2

xl,x2

>0
_ _____r

(c)

Mininiize

Z: 5Xl + B X2
X1+;12:.5
v -r \,21.,\irnz ,l
1f

Subject to:

x2>2 xl <4

t0;

Part (a) ls compuisory. Attempt one trrore part fi'om the remaining.

(a)

A coSP$/ is having a problem of scheduling its monthly production for the next four monlhs' The production
capacity and unit cosiof production is gi,r"n in the table belor.v.

I'TO

'i'he ploduct prorlucr:tl il 'ill,: ir.t(ri1lh tr-r.r'. l,r-' li,. lcl lbi'sir jc irr llri,_r rirttiiilrs, tnrl a1 air estirtr:rteci slor:tsc ,trt_ci rl i i{ ,' i ,rgr' 1;11rr ttrottt[r. 'I ltl r,r.rrn1':irr.,, r]rrrr,l itrgduce i' sufilcient rir-rarrtit). Ii-i lui..1 tlri' ;,',rr1r.."luai Sair,,'1. je-; in flte ncx{ l(ti_r ntor.}llrr ]iol, shoulcl the prodr.rclioi; ite sclteiii; jerl :;, ; its fo rninintizr: toial cost'/ -----_. -_-_ _-{ I.51

!o)

soli'e fbllowing assiglllllerlt Ptci.,lelr. li'he ciata relbrs to the erafor

irr u^its"---(10)

_t__l-_L_r--; 4|
ld r9
,l

A:-Tt-

h{achines n 'ff.-

'roducti.n
\l

tr!\

I
7
4

assrgurrrent probleur .-ri 0\

ol assign\ five

jotrs to five ilei'sorrs. The

w-"
(a)

lart

(a) is co'rpLrlsoll'. 1lt'Lempt orre

'roLe

pa-ri

li,,rr the re'rai'irrg.

_-_ ___(l(]t

Give tu'o Practical e;xnmi.'les o['each of-the ,llorving sitLrarj3n. - Bulk ar r-ir a j. sirrgle server. - tlLrltiple parallei facilities .,vith ntultiple ciueues - Llst cr.-lttte lirst st'l've. - An"i..,:ri il.r:,1 li;rii: pt.riruiatiofi

(t') '

accor-rnting and inventory control. about the systern installaiion

The orvtler of a chalil of fast food resJaurant is ionsiclering a rlew courplr1er sl,stem lbr. A conrputrrr co,-rlrrur,i ,i,t tfr* foiin*ilrg infoi"matiorr

{''rc

APl,-nfrf -e'g c'r e

/41

Activity

Activilv Descliption
Select (lonr Design input/Output Design N4onitoring
Svstenr

Inrrrecliate
Preclecessor

Optinristic
zl

Most

Pess irnist"ic
8

A
I)

Likelv
6 1
O

-e
q
E
F

L)

A
R

n25

t5

Assenrble Hardware DeveloD Progranr

l5
10
0 ()

2A

l8
o

26

C H

Develop Input/Output routine Cleate Database

l6
t2
3 3

4
6

Install Svstem
Test

D.F

2
1

&

hnplernent

GH

(i)

(ii)

Construct au arrow dia.gram for tl-re probleln. Determine cf itical path and expected project completion time.

(c)

A lepairman is to be hired to repair machilles that breakdown follon'ing a poissol process with an a\/erage rate of fbur per hor:r. The cost of non-productive mzrchine is lts. 9 per hour. The colnpany has the option of choosing either a fast or a slow rel)airr]larl. The iast repairman charges lts. 6 irer hour and will repair ilachines at an avefage fatr-: of 7 per hour. Tire slo*'reltait'trian ciiarges I{s. 3 per hour ancl will repair nracllises i:r1 ijr a\/erage rate o1'5 per irour. wiricli rep.i'nan sho'lcr be hirecl? --- i15)

3-+frt(a) is cornpulsorl,. Atternpt olle lllore part fi'om tlle reinaining. (a) Write in brief abour the follo.;virlg: ---------_--------------i l
!i)

' Pseuiio Random Nuurber u Discrete Simulation N4oclels * Trvo Ferson Zero Sum Ciatle q, \r *t*w\\r t**1,'{'if *,' ' 1n' \h''''l (b) 7'O"t'er 100 days period, tlie claily dernaud of a comnroclity shons fbllorviug \'r' distribution pattern. Sirnulate a ten clay seQrjslloer of clenrancl values, - - li-equericl, ( I 5)

Daily
Demand No. of l)a
Use follorving set of l{andom numbers.
67 .84.01 ,77

,90.14,15.7 4,44,1J

l"'"{'o

(c)

in

gltl.lA has thrce possible ch.,.i,:es I-,1r4 ancl I.{ r,,,hile pia.,,e. Ll has tu,o choices P and Q' Paynrents argto be nrad' ,l""ordir.g 1o follcx.r,ing orrung.-r'e't: ---(10)
a cedaiu

LP LQ
N4P

MQ NP NQ

A pays B l{.c. 3 B pays A R,;. 3 A pays B I{r. -5 B pays A R:;. 2 B pays A Rs. f B pays A [.].., I
ancl B

what are the best strategies fol player A

intlrc ganre'/ \\/hat is the valtre '

crf garrrc,/

AICl'Il

B.Tcc'.(Sevc' r * Sc nr csi", nir'nri n;iiout u*.-"rn,, ; Subjcct:-Opcra{ions Rcscarctr ' -",'1if."

.: ,;.1,., ' -1 .r .': ,:ri:

Citrtlc:o

:utt.

;ffi ff:'
';

l.:.1#,,tr"V*,

Time:ThreChoUr.s

ii

: ,,i,1:[Sfii:.r.:fii:,j i\lax M:rrk:I00,

l\{irr l,ass N{ark:35
,,

il,:i,'J'i;::'11,,:ft:,:];]:''"
l

"'

'\il l''ts.l':r

t1'r'sri,,r) sl*rrir,i r)(.i,rrrr)rrlrctr *r trric jrr.ce

't

i).,,.,'. ,li I (ilLr.,i:

i

l:l i-()lt:j'rlilSr,.,. ,\ilutiii;,1 r)l)c lii{.),.d

pliil i),)tr} iii; li;i;l:'tiii.,r.

i'.xplli,: tlre iirjlorviirl s i rr i ll r:ir n i:c. (li rr1, iir i .,rJ

r-l

.*,,t'
..: :fl . :.:.1:
-

'=i* Ll'f

.':

.:

'-:::a'::: !' 1"'..,:l:i:i1.1:::, I a':a:t:.l:.i.:-. .. .-:r-i:.,. rr-i'..

:. :. ii.,lt i
-

.t tl) )

rrlt B /-l.z!ar/ !

tr.\..

'a fti -g u 1 lf1 UE- L i:-? f

)/r. " '{

llrrr''' t1'Ie5, t,1- plotlrr..l:; }i \r' riir*.r ,1 irrri rrsi.s ij}r.,-,r liI,liL,ancJ lil.,l'iie lbilou,ing,,llrrr ait:*irl,r,, -_____--,-__(151 ,tU5;,ttnrrtt'r.iul

/ ,r' ( rrp11'1111)'Jrl')!ltrees r\
l''i.,

Slacii \,:rr iable ve-'. Ireasibic Sloiuticin r""Fl r\ I rernirr e ()pti nral Solutiorr \r" " ii crir-rrt, iilu, eut.]itr.lr : jli. .-1.-iS c ns iti v i i;, z\.na I ys i s

ttnlts giving: :;tutirlrjt. rr;iillul)lc i.luti i,lr).sicirl __ -- _-_ -_ _( I t l; iiii'-i r'jtl,r- j,i*cirr l'rograrrr'ir.g r)r.tlbre'r.s

"
1-

j I _I I ;;i _ , -l l-':--, i ,,- _lI ,

rrr.rx jiiii:r.c

':iri I il. i

;,,.inL.rrt r,j pr()(ir;rr, (,,,"

l,9u

i I i., j1. l- , 1.- 1 ,?,,-l-I_ l- " fr. l - 'icn :,iii, __l l rrr.ti i ] ,ru.0g_11-[0 j
t I

_\'_)__1, rq- _

rl-,

r lvlrrr. t)rrrr,. -l lr\viiilrrlric .--;;

--]

Solr,; lll': lrioblcnr lo

(9,

1-rrttlit.

.-(_;,-.,-.z\ --9

ti

',

Niux

'L=SXl i2X2Ft0Xl

.x .t 3'z

------------i

-'-).'J, ii
I
r

'13 z

'l!t

! )'l
Y

S.to:
I

Xl-X3q t0 x2-x3 ) 10 Xl+x2r,.i3 u to xi, x2, x3 > ()

l) l',-'\

r:i:l'v

l) li|t

(a)

1S

' .\r li,'rrrrri C()ntl)LtlS()l\'...\ltrlt)l)l ,rt1ir rt1/\r-, ,...,-, i.. ..()lle !lt're |J!.t l|il111

.r

"i.-"

111.,

tei{jilillltlg.

']

.i.,

6 $*r\\

(a)

f,i-' ;:: \\/ritc ceneral Nlathcnraticar N,fudcl of l ransporrarion problern. I-lo*, -!:':'j,'i: lransportation problerns arc diffcrent than I-PP? -----J..-' .,t firL' producing a singrc producr .l pra'rs and froCuce 30,50,40 uttils tcsPectii'c11". 'as c:i'r. hirs conrrnittc:cl to suppll,Zs urrir{'iii l-hc ( ils-[()l]le l 1. 2(J rrttits l() ( Lls[()l]t('r i rtrtrl il! lr';r\i l0 Luirt:; t() ,-jrislo,,,cr :. tlttill (tlStolilcr l & -i ltrr ri,illjriti to iru\ iuir irrrrlthi,l,iil rrrrits llclrrr tir. crl. I1l.. lrri,tit llr:s{-)cialc'i is sltr;iitt iii tltt'llt[llc 1,,-l.ri'. \\''rrt'litrirr llic rilllirrrlrl rlistiiirtrli.rr p,,,,arn.

;; ;:

,H1; .,,.:lC

4;;;;,;r;:'1ffi,

;,'*

__-(

"9--"Pp!;

<$
\-(*.

d-lo
./.

_.-'(c

c('its

l-.e assigncd to six rjifli,rcnl rnecitincs:. I'irc rssociatc..j l-)':tc;ttiittc vi'lricir rnirclrilc shouicl nt.rl be assigrtcc! alii, joli Lr, rtiiitillli..,-,: tirc ttttai cosl / -*----------l i 5)

l:ii'c ti illt'rciti jirtrs irrc t,

.iit ilii'etr bcltrt',.

l l

{-,

--

lr lz
i1

l_5

Ir' Iii
I ()

---.. - .i -I

! I
I

lb

.-.,,-l
o

la-r i0
t

il-

i
I

ll
i)lr:.t
(

j.l
i

f.iicr rlri ()nc nt0lc jr.li

|c nlal t) t n tl

(.i]

l..rjii,'ltrilrL.,i-ilj c\ irril;ir,.of iblilrilili!t

tit:ji':j

_-_" (f)

'

i _:isi lOt1ii,j, i il

st

serrYc

(b)

rvith children's requirements has one cashier v,,1o handles all custontet's plt-r'ttrcttts. Thc ciisirie r rlikcs on an,average 4 nrinutcs pel , custoilltli'. Custotrtcrs conte 1o cashier in a rlnCorli nlilruter but i:rr an rverage of l0 jt,lttr. Ir'.llrtlget:ierii u'arlts to iir','cl':titlile 'tirc Peop'1. Ftr fbllorriirg: -,, ---.--- -( li)

A clrild care shop dealing

.i-t::
.lB',
,r:lli

,i:..
I.

+,.
",-,$:::

iig:':i
;:ini .

fai. :ii-:l i:1li:, i i =:;{ ;i-,ii':

+'.., / {,: -.
., "1'

Dtre

-J /+N * 26 a'/ *ag

Ar c.re

(i) (ii) (iii) (iv)

' : '1t:'':i iengrh of rvaiting time to be expectetj'? \\'hat portion of his time cashier is expected to be icile? \\'lrirt is tlte avcragc' lcrrgth of (inrc that a custorner *,ould bc cxpected to n,ai{ to pay fbr his purchase? \\/hat is the probability that a crlslomer has to wait atleast l2 minutes?'

t'hat is the average

i:':

llt r' r ri-'t't I 'll,'rviltg jrtl()l,t) ltir,tr.ltr'lirerr

. Aetir iie:,,'\.lJ.lrrrtl l: rrlr" ire st;rrt,,'tl lrl tlrc beginnitrri ol'llrt'Iroiect " \\ihuir lciivitv l3 ls cortrl;lcte l) lnci (j nray start.
u

&
r.

. Cl clurr,trr \\lrrrn [)otl] l:unti i) iri'e eonrplclc lrrd is Irurl lrcti\rt\ * Il car :teirI aliel C is cornplctc arrcl is llnalacti\it),, e K nrllst loliorv ihe finish of E. " l- clin llot stiut Lintilbolh (llrrrcl K lric contplctc. . .l clin:;llLt't r.,'lrerr l. is crr;nplt:tc liriti rs iinal activll),.
l:r,l tlrtrati,lrr
Ac:t:r'tlr

\\']1.-tr llctir itr . , IS 1.,t,,1,.1e .. ; itlitl ..iilt't.

1r"a T- Nlrrr

i{,

t-

lalsl -8 ---l _l
1811.0 ,12

-T 't.lt rr*

- l P.,.'s",rir1"'r*" ]

--l-r*t-l---r:----]

-l

l(r -

1--l

i
I

l)t:irv tirt r 't,. . rr i i-t.'lcr rrrri,', r iiic.ri |lrtlt 'tLrrislr tiLr, li,i ,rr, lrrr,,lirri'
,

l)ei.t:r rtrinc crtr.l\, sllrrt.

I i I I,-:

:: I

lt r'i

--(i.rt

i .rr t (;r)

l-/

.9'
' * u

Write irr bricf about thc

follo*'ing:

---------( l0)

Pseudo Random Nuntber

D]scrctc Sinrrrlation lr,locir:1s 'itt,o l'crsorr Z-clo Suin (liriirc

\
&

rr0

Vlr)

largc rr'urkshop is undcrtuking servicing jobs. 'lhe rlcchanics ob,lain their tools fronr a central store. N'lanager:.'of tlre workshop is worriecl:d'bout' the u,aiting tinre of tire mechanic and is in the process of detennining"r\'lrelhcr -l-he nlore altendants be hired for the store for raising the levei of service. follou'inp (lata on Lhc tinrcs trctu'e.ctt successive arrivals and service tirncs lor llt.' rrrrcllrlrics lrirr,.' irccrr rrirtltirtccl lltltn tlrc plrst 20() trltscrvirticttts tna<ls t,tt the - ---( l5) S\:ilctli.

'*.E

,.
i!4

EH

!i

l)i
'l'inic

L,il'rttt,,1 tLl

Lril: r.,1

1ir,1i 1i1rrt.

1i\'1inut.e s 0
J

lrrg1gq!15_i

l'robatril4l
0.06
1)
11

t2
I

i.:

1)

6 9

)0

0l5
037
0.16
0.07

i1
l1

tz
r5

I)isti iirrrlioir ()l .scr'\'lce lrlr)e ]Ullg iN1r,lrrrt.

.1

l
8

Li

llttir-'

Ilrrh$i1ilr
(i. I t)

(r

tl
I ('

_i0

0.lli
/l.1
1

8E
.1

t2

0.24 ti'.ttii1-'.'i. detet'tnini: ilvcragc tinl': of tltc lllcChallic ltrlti

l.isirr' lgllt-irling rattrloirt

i1\,,rt;tgc rlll(rue ielrgtli t,') 'trrilLrllitirrg'

lor l5

rLttls'
:

ii..ir;,l,rtp-pt,,

ltlgfiLhil

lil'.'l'l.l-1 (r9,i5,55,i-)()'90,66 'i'tr,39,15,90,98'j'9 g'i l, (j.28,97,69,37.52,:)2,

I 5,8 5.4

it if i l,,l_rl]l.lt LaI Sir,\_!!!- iilr-L-t.,-

1,82,98,99.21

--i

- -- 2
(l - "-'.'- --'-'-'

--l
.*-,
-j--''- - i -

er

ll _l
t;
I I

--l

_6:

i,i:: 'lli

':-

,',,:
fi,;l!

,' e

\r:i:

\li

',"i
j."

nrle h.ln . t\A:i^11 u6 i r : t

;
c
a! :::
". :l',

,i', ',' il;r

.i
ri .,
:

B . E. Sevenrh

S e rr e.srer Ex:m i rrirj irn a (Mechanicll,f n3::rccring ii rirnch)

r

p r- 1,t,,,:z0ttdrie.rNo

;rll., 'I r. ri '.'l.tI ,:.ii: :.i ii:ii

:

OPERAIIIONS RESEA
T'iu.ic:

}{

CI]

'

':i': : r'l:

r ..

'

:ri :,.1i;,,, ,':;

I i

':

3llr;ilrs

il,Iax lr,lin

::in

,, r

lrrsi

ir4arls h{erk.

: 100
:35

'ljl ":l l::'l ..i. : 'l :.L ;:'l ,i ,'' f;:;;'; il"' ''
"...
r
'11

Note:

,iilt.*t-r;1.;t

aliswer cOpy.
1

all.the questions. All Ilatls tjf a quesrjofl ;iii-:iild be aiiernpred at One piace 0f the
i

'
i
I

[':Lr.l

i,!'
l1:
;;.:;,'

."j ".:i
,,1
I

, ,, :ri., : ril

,W

url
(a)

(a) is compulsor;', Atternpt .ne morc pan irom tire rernaini'g.

l:llt't V{'i
II

the following-teTrs glving suitablc e)iiunDlc anrl physical significance, (anv

', 1-:'..1 i :,, :..,1: ..:.;it :..tI :r : '...t ...i ll "i:

.11

,l

';
:).

li.

a N{ultiple Optirnum Soiurion r Feasible Solution J Canonical fonn of corurrainrs ! Shadow price
(b)

" - -- -----:--------$----(15) r lurylus \,r^-:^Lr- *fl-y{i'/fc,,\q[ ;,, " e,,-r,,^ Variable ; 4 9,t,-uAa,_/rtc. ; -- \ Redundant Consrrainl U' " I Degeneracy ix LPP . al 6 &g( itu

"':i

Sr,.il.,iiollo1yingb1,8raltricatmeLhorl,indicatefeaslblgregj0Ilanoina.l.atl ^-" !{rru "'v'/efe :r'dunia;:r consrdinr, it'any. _-_.,_- _ - _-gr;;^l Min Z =3Xt +5Xz
.:'l

":'"iiti !:

S.rq:

,:

-3Xt #X2g12
2X1

EX2>t2

xl\<4,
/ -\ (cj

Xl Xt -n
XI

x2>2
to:,
XJ>z

/ **-

trnntmtze7-. = 5

+g X2

Subjecr

'

xt+x? -{ Y] Yl ...1,,_.-J.J^

. (a)

Pan.(e) is c-ornBulsory'. Afiempt .ne m're pan fr'm the wrlle Generar }{athernaticar }Lfocler orrra'sportatro,r"trror,tem.

Lemainine
--__-_-__---_

._(r0)

\
{
ir {

,l

.ii.i
.
i i.,

'iJ

"i',
:

i;: ' ,'.1i;i;;ii;i]',, ' rt ' .i:....11.:.ir,.r;-il.r.,. '., . .' il, li rl ::,':,i:,:,..... -.,::,ll,i :: :i; ,r;:l:i:: . I

":l:Ts.*o

!.- , :.
.

.: .

.i
;:

in)

rnachines, i:0sLs are given beiolv. associateci Dercrmiqc ivhich rnachine shoulcl n0r be assigneO.aa, joU ro nrjnimize rhe total cosr? _--_-__-_

f rve diffcrent jobs ai.e rc bir :ssigneij

ro

slx diFferent

.I,he

1.

,ij;;
3

lz
r5

)
8

i i\4.5
|
11

\,16

(c) soive r,e lbllorving assignmenr problem.

Thetaa relers ro pooor.,lon

,oil
D
8

-(15)

A
10
11

L-7

:-*]=--J

9
a
0

10
1

4l'l

3
(a)

1 Par-r (a) ts compulsory'. Atrempt one mcre part ir:om the rernaining

!
5

.l

Gil'e

r{ic^i-r;-^ . ' i:ll:;::ff*iTffi;;;#;inn;

111L.

t . . rf

sel-ir-c

...

..

iJr:lut\,S:rl<.ronrviihrnore,flrni*..Urlr,,.,uo.
strop inside a

r;n

.,.,

er

-M
Ab\

g$r )ig*t" .r.L

:
nrecita:rics irr an

r;;';; u,*r.l'r,

fi_.r-r l, m:rchincs ui rhar plrircrt or Ula[ lar hclory onlt,

, i 0p, f5,1
:'i:' ": :;rt:::l
'j

w
(c)

JJ,,|,'l.:'il:';r'J:'iTJ'T,i,.|'::'::store, se^,cti 0,, u iil-s'basis. The srore

rvlrere service

'il:li l: _::ll]uf ,lt"nor;;"# jiL.il[:fflitilqilruiru;r:rxl.---.----...----(l0) 1r') Expecred number.i;;;;#i:u,fi*ourr..

o.i,iJur,.o,'.il:ffi:

1,.11 se^'iu-

.",,;j# il,l';: il,?JJ,:i ri,ri is c;i,onenriar

.lrc

is ,,1r-.r':n,., o,ib attenianr t:]:: ri,[6 li' or irre"iechunics.^, ui.rj'.inr,, rates 0,.,,g,s 6 r*J #;.::l::r i,,

io,,oo .^",;;;';'il;:Jiit;:Xi:f:,t:l'Jr*

nrec;,nics,rijvc

(it
4 j)u
(a)

(U

What do you undersand by Free Fbat and Ildepcndenr Floar ___._.r5; \Jr\.1. pmcrical example of butk , ,"0 ilr,",* server. _,___ --_f.)f

,*;;i

is conrpulsory,.

.)

Attempt one ntorc pall j.ron tlte rernaininr.

\\/n,

APp*nnf-2-eoT
I,

,i

ArcrG ,,
\,,1"
i
:il

.j
:

\, ,i:
\,ir

\
::it .'
1,. '.i. .. :l.il
t

(.. 1 ' ''

Pserido Random Number Q Discrete Siniulation Models

I .i :t-i

.'+

'
(b)

Two Person Zero Sum Game For a i00 day penod, the daily demancj oi ftequency distnburion,

'
a

.; .,: :

,,;l

cerlain commoiliry shorvs loliowing

:

: :::1.:ji+ir,i!: ' ;i.-:!i

':

':lr:'
.i

'.:'.::.

': DaiiyDemand 0
No. ofdays

.:

,.a...,;;11 'r:..:rt:t

;'j
rii
.:l

102A402054

li r::i:.ei,:+. ' ',

i

.i,':,

,, ,,:':: rl :l:
i iill'r+'ri;rjJs

:l;

, :.t

using the raxdom n0.67' 84,01,7?,g0.14,1i,74, 44",77 simurare a ten irey.\,rjruence 0f demand value and,:detemrile average denand.
(c)

'ptunar determine rhe value of rhe_game. The payoffmatrix for ptlyer

Pla
I
r

using dominance pr.pefty, obtain the

srrategies

for boih rhe playen and """ a-i, gnou, " -.ii1'.'"
i

iI
r4
6
I

1Y

n/
8 7
6
0

ir ll

tll:
:<.

t3
3

m n/ 1Y

i'6

l1
.)

.4

i9

,'il
..4

:t l.l I '': ii rtl '' rri

/

Jt

:rt

, l,i:i;)',,ir ''.,':.i rl

'': . " . . ti .',.1 rt .,, ii:ri : :i .:;r.l rr 'l .1' l '.: . .i .:i ,'::l
1

.{

1r-i;."1

:.. .:: .ti

l

,J

:''''] .,::'i
:t:i

r{r:'0T!l_i
Code No.067021 - $'4 Pl6Y'pec 2006 B.E. Seventh Semester Examination (Mechanical Engineering B ranch)

OPERATIONS RESEARCH
Time: 3 Hours

Max Marks h{in Pass Marks

: 100
:35

should be attempted Note: Attempt all the questions. Al1 parts of a question
answer copy'

at one place of the

lPar1(a)iscompulsory.Attemptonemofepartfrorrrtheremaining.

\,: \.

(dt

and physical significanee' (any Explain the following tems giving suitabie example

five) .r' l) -82 Artificial

Vari,ablt'

{irjl""1,*.:-u

u!-1.,i,*\'
L-f

1"'-'''; 'J.jttt'' *
,,

".1.'

'i

".i.i,i
. ,-,

,!,,i-iil* +,i-i# \4'

'

narrorver widths so as to satisfy 55mX1 rc,lls cf cloth of The rolis of ctottr oi size 55mX180cms are slit into the following dernand.

V-thadow

Pnce

;--a
80cms 200 45cms IZE
27ems.
130

i'.

{''-

n=u

.1' u H {qX

t1

\ u\)v-/ ;;;"g*,
,

lltc fonni-rlagion of slitting p;:(}gram so as to rninimize .= ru_, O6tain the trinear programarring ------------"(10) d*ring uUttil"g arid also to satisfy tire ai-rove demand' for eashier' A Z4-h0ur supenaarket has thre fotrlc.,a'ing miirimal reqliirements
Feriod Tirne af the day (24 hr ciock)

Widtii No. of roils

'.:".-;\l

e,'/:'J

r:--..'r.-=-{-.;----l-, 3
I

3-/
a

7-X

r 1-15

-ffi r5-i9

5
L-a-23

z3-3

Minimum
No.

20

L4

20

10

' :
.--

-{
i

pefiod i follows immediately after period 6. A cashier works.eight consecutive hours, starting at the beginning of tne or the.six periodt tr"gs11t gitJl:J-"T*i1$':-;1t whtch satlslles ine n.nnruit*ioe protle,n to determine a daity employbe worksheet' --------(10) ieast number of Personnel'

*qurffi*ffi;fi't

personnel'

'
i !-.r, v\

"Lt

,ot,iu, :
-3'

ivlr.'- - e

P-Ta

I ' ,ti.

i".-. ! t'lttt--

one more part ti'om the remalnlng Part (a) is compr:isory' Attempt

,kl\TiiptiAirlinesthatoperatessevendaysaweekhasthetimetablegivenbelow.Crewmust ur q 'vsr" Vf il'fJ'1il'#ffJH"li*1"'?,i e ftou" between flights' Obtain the paring.:l fltll:"fil r-.lo a rninimuffr lavover of u #ii"T{{'":.',':I.-o:i:,T"'*'.:::TtJ,1 llt#:.f:: have c mintmum l?vovcr lring the crew wili be based at time away from home F"1 Ty-g^t'":l.L minimizes layover -o-ri^. the citv where crew F"'

il:":TfHjit':ffiJ'il"#;il^il;;;; -------- ---7

should be

based'

"'n'p*

1T-:

T"""',lhe
Mumbai Departure 9am
10 am

V
Chennai

Flight I\o"
I
?.

Chennai Departure

IV{umbai

Flight No.
101 102
103

Arrival
o

Arrival
11 am 1? nnon

7am 9am
1.30 am

11am

?iOnm
OlOnm

3.30 pm

5iOnm
10 pm

7.30 pm

104

8pm

rs. Three plants pI{''uuLtr 3 piants and 4 customers"lhree Plants Produce (b) A firm produ t;, "ingKngl.,pr*u:r^has ctiv e rv' 3 0,s 0,4 0 units re spe 3,t";:',t; 4 are wl'ing to :': l" customer 2 & tj,:STii tl';i: shown in the table below' the co' rttt pi"nt associated is buy any nurnber "f ;;;"i; pattem' -:--- -- -------(10) Workout the optimal distribution

*: lii:;::l ;:* iliil;i'"Jlliil""i:H;iJJ;;''il;t",r::3::"*

{lustomers w
Plants
1
1

2
16
17

zl
t7
'52

25
15
18

t8
.LU i;l

1
J

27

30

;s1

'; c c^---,^r. can nsgiened to five different rnactrines' Tire profit associated (*f/.' table below' I)etei A bateh of tour.loos ^.-*h. i:"::":-:,::;;;;t*e -fi."" .*r;;'l?:H*fi is shown in rhe to a given tnachirie

35

# lx'^'T:"ffl$d;';;ruru
.t

r"n;n cach i"b:i';;;-a'sign*a 1t,;;.^- ^^,,i^ he the ext.ett'r- oI max! **'::S,$:*""'.'*";l'ffi #q1;;;;111:ttgg1ff rheextct-ef rnaxjsusl-lffiH*"'ft.'tr-'?:::'*Lii;H:trff |;H,:fi -i"*:#;l"fi :ffi et'---- *- --- --------(i0)
2

IU
7 t--:-t-)

B
tt*
I

tl 11 It
6

2
14
1-

I 6
o

i0
a

12
14
"7

lt)

113

lf

t1

10

the remainin'g' *Vun(a) is eompuXsory' Attempt one rnore part from

1t:

,*,
/'

r{, \h
!! r

"s4.i1 r#fi\ )i" _/. -, \.). - , 'L!r" ! -: --n +r,ri'' .\ -Ifi:6

".t,t
-

JJt

!"1;'r I

\{

+-.:'"
.._-'

r': \'

I *
(,r)."'
Activity

. d.ia * O oi', fl*Hz,

F/

ov * D6-c * L{z'("

"WU-"

27CTG

considering a new computer system for ,A;r"ro, Iinu,n of fast food restaurant iscompany sent the following information :? 'and inventory control. A computer ----(15) "r/";';;";il;iystem installaiion about the
Activity DescriPtion
Immediate Predecessor

Optimistic
4

Time Most

Pessimistic
8

Likeiy
A B C Select ComPuter Design InPutlOutPut Design Monitoring System Assemble Hardware 6
7

A A
B B C E

15
12

4
15 10 8

I
zCI 18

D
E
F
\t

25

Develop Program Develop InPut/OutPut routine

Create Database Install Svstem Test & Implement

26
16

9
8

4
I

I2
3
8

D,F
G.H

'l

(i)

(ii)
\{e)

Construct an affow diagram for the problem' Determine critical path and expected project completion time'

piocess A repainnan is to be hired to repair machinos that breakdown following a Foissoll pei' with an average late of four per hour. The eost of non-produetive maehine is Rs. I 'fhe fast hour. The company has the opti*n of ctroosing either a fast or a slow repainnan. 7 per repairman charges Rs. 6 per hour and will repair machines at an average rate of machines at an average hour. The slow repairman charges Rs. 3 per hour and will repalir ---{15} rate of 5 per hour. Which repairman should be hired?
Pa_r{

4 -.(")

(a) is compulsory. Attemirt cne nlore part fiom the remairiing.

Write in brief abcut the following:

B

Fseudo R.andom Number

Discrete S imulation N4odels Two FersonZera Sum Game

' /tti their toois $N % large workstrop is undefiaking servieing jobs. The rnecharries obtain waiting time of' the frorn'a central u*r*. h4anager or tn* workshop is woffiecl atrout of detennining whether more attendants be hired the mechanie and is in the process the times iletween for the store for raising the l-evel of service. The following data o!1 have been obtained from the successive arrivals anl service times for the rcechanics past200observationsmadeonthesystem.-.;---.---:-

?'T

Distribution of Inier arrival time:

f ime (Minutes
0
J 6 9

FrequencJ
12,. 18

Probability
0.05 0.09 0.25

12
15

50 74 32
L4

437
0.16 0.07

Distribution of senrice time:

Ti$s(Mirytes
4 6
8

Frecuencv

Frobabilify
0.04

I
2A

0.i0
0.18 0.44 a.z4

10
L2

36 88 46

avel?ge tinre of tlre meehanic and average Using foliowing random numbet, deierirrine querre length by simulating for 15 runs'
.

9,4'7,23' ;69$ ;ss'og tecipti S x

3*;tsf8'98#+' - "'

Rarccmno.rorSer.vicetin:gt'7,3g.i]8,}7.59,8.7.::,2,52,1,5,q5,41,82,g8,gg,23 negotiaf-iirg a new three years setttrement' A cor'pany'S man*gement.and laborunion are ,-. l4 ijach partY has four strategtes: . 'r";\:-' "it- q*' ' r,-- , .c th) ' slFl" I : Hard and aggressive bargaining approaeh IL: R"easo'ning arrd L-ogical apploach
IIX: aPProaeh iV : ConeiliatorY aPProaeh

lrgalistie

choiees are given il,t}.* table beicv": Thc cost to the eom1lany for every pair of strategic ------(15) Find suitable strategY.

Union StrategY t

eo*puqy Jqutggy I
20 25
4A -5

EI
12

w
35
10 J

15
AA

ili w

1+

I
10
11

2
4

",+ . .'"'..',
.l:'

'

# qb

-.J: