ffi

For More Question Papers Visit - www.pediawikiblog.com USN

10ME74

Seventh Semester B.E. Degree Examination, Dec.2015 lJan.20l6

Operations Research

hrs.

Max. Marks:,lffi

c, €o !O

€ x1-x2)l;

b. c.

\*a2)J'andxr,xz)0

lo

usinge the graphical method, answer the following questions: Q --r------What are the extreme points for the feasible region? If the problem has an objective function, maximize z' point? iii) If the problem has an objective function, minimize z

D ii)

:

3xr -r xz , what is the optimal

:

point.

3x1

Subjecttoconstraints:2xr +W<6 ; Xr-Xz>3 List any four characteristics of a good model.

lr str Solve the following LPP UV E& ivl method. ; € 2 a. Maximize Z:3booox, {Zpdoo*, *iA r*uw

x2 t what is the optimal (10 Marks) 2x1 + 3x2 (06Marks) (04 Marks)

w

AS

t

Z: ; xr ,xz)O

Solve the following problem using graphical method maximize

ik

SE E = =ia "*,, troo :E R H; i H ;E AA

*

The following are the two constraints for the LPP under consideration:

GI

ib

E L a. g E R b0:

,.*Ur-

g.

PART-A

6 d

tu*\*

co

Note: 7. Answer any FIWfull questions, selecting atleast TWO questions from each part. n (Ise of Normal distribution 2. tables is permitted.

m

Time: 3

rB-

E

S

; 5 bE

b.

xz36;

x2>2; Q

xr1_2xz<18;

2x1 + and X1 , x2 ) Write the dual for the iollowing primal. Minimize z;xiffinxr + 35000x2 Subject to*:-,f0xr + 60>t-:2500; 80xr + 60xz > 3000 Non-neg*ffiiy constraints Xr , xz )

*,5M

ed

fi: E&

Subjectto: x2(x1 +.3*W

:

*"o.\ \"qp/i

.p

F5 EE ts E

ia

';

0

(14 Marks)

;

100xr

+

20Oxz> 7000 (06 Marks)

3 a. aAffit is produced by four factories A, B, C & D. The unit production costs in them are EE *W, {1:and {5 respectively. Their production capacities are: Factory A : 50 units ; B : 70 ii ; C 30 units and D : 50 units. These factories supply the product to four stores, the ,*ffiits u ;0 S n demand ofwhichare25,35, 105 and,20 units respectively. Unit transportation cost in rupees 'E q a*1

w w

[€

flEq .dry% E [ uq}:'"*;:'

w

:3 zg E

X S

from each factory to each store is given in the table below. Stores

Factories

| 23

4

2

t1

4

6

^fr-ail BIl0 10 lalzlsl 7 J 9 t2 c fBTiTtffi Dl4l6l8l3 4 6 J 8

L

13

I

5

I

I

8

I

|

Determine the extent of deliveries from each of the factories to each of the stores so that the total production and transportation cost is (12 Marks)

minimum. I of3

For More Question Papers Visit - www.pediawikiblog.com

For More Question Papers Visit - www.pediawikiblog.com 10M874

b.

Four machines Mr , M2 , M: and lVIa are to be installed in a machine shop. There are five vacant places A, B, C, D and E. Owing to the limitations machine Mz cannot be placed at C and M3 cannot be placed at A. The assignment cost of machine i to place j in rupees (1000)

&"

is shown below.

m

A

* \r/S **/ ,a * dm*/

D

4

6

Mz

7

M3

4 6

M4

9

J

5

6

5

4

9

6

2

7

2

J

10

.?r

,B tuq

6

co

Mr

1

d^

,\"J l4n'\

Find the optimal assignment schedule.

(08 Marks)

g.

dt\d

*){-, tg-

Solve the below given integer programming problem: Maximize Z: 4xr * 6x21- 2x3 4xt - 4xz < 5 Subject to

-xt * 6xz<5

xl , x2, x: ) 0 and

X1 , X3 are

!

integers.

S.\$

-" 'ilihr

ib

-xt*xzfx:<5

lo

klJf

\$1 .!.__

;*

(20 Marks)

a

-"#

PART,-*#q*

B

Immediate

QFt{mistic Predecessor- %!neb (Hrs) 4

A A A B,C B,C E.F E,F D,H G, I

ia

C

ik

A

w

w

Following data rerer fer Io a Activity

D

Time(Hrs) 6

1

4.5

J 4

J

a

Time (Hrs) 8 5

J

5

6

1

1.5

J

4

5

I

1.5

5

0.5

ed

E F G

Most likely Pessimistic

5

6

7

2

5

8

2.5

2.75

4.5

K

J

5

7

H

I

.p

J

Draw the network diagram Find out the ES, EF, LS, LF and slack for each activity. Find out the variance and standard deviation for the critical path. Determine the probability of completing the project in 24 hrs.

a.

Mention and discuss seven elements of a queing system. (07 Marks) Defne : (i) Balking (ii) Renegging (iii) Jockeying (03 Marks) On an average 96 patients per 24 - hours day require the service of an emergency clinic. On an average a patient requires 10 minutes of active attention. The facility can handle only one emergency at a time. Suppose that il costs the clinic {100 per patient treated to obtain an averaging service time of 10 minutes and that each minute of decrease in this average time would cost the clinic 110 per patient treated. How much would have to be budgeted by the

w w

a. b. c. d.

(20 Marks)

sr..lr*,

.t"t

d*,k

w

\/\&

tf

r. 1r-

c.

clinic to decrease the average queue size from

1l patient, ,o I patient? 3' 2'

2 of3

For More Question Papers Visit - www.pediawikiblog.com

(10 Marks)

ffi

For More Question Papers Visit - www.pediawikiblog.com

arl 12 azl 6 a:l -10

A's Strategy

-8

(04 Marks)

*.w"{ (y*\d"

m

b.

What are the characteristics of games? Solve the following game by the dominance rule. B's stra b: 1

,d\

7

3

-6

2

.i: i,.\$i,;.:{.it fJl:

.e.

*'h

\

co

7a.

"

10ME74

a2 -6

-2

(08 Marks)

You are given the following data regarding the processing times of some jobs on three

ib

8 a.

-7 4

lo

5 6

g.

Can we formulate the above game as LPP and solve it by simplex / Big-M method? If yes, discuss how? (08 Marks) Solve the following game using graphical approach: B's Strategy br bz b: bq A's Strategy ar8 9

w

ik

machines I, II and III. The order of processingris I - II - III. Determine the sequence that minimizes the total elapsed time required tg"complete all the jobs. Mention clearly the total elapsed time and the idle time of machine Il'aad III. Processi rme (Hours Job Machine I II ru

A'q H""-

J

3

7

2

5

4

5

11

E

9

I

5

F

8

4

6

G

7

J

t2

ia

8

7

.6

ed .,

f**:, Udi

. ,.;\l

*"'

6

,i:rqe 5- D

SA

r q.3

4

(10 Marks)

w w

.p

is the supervisor of legal-copy-express, which provides copy services for Los Angcrcs r-os Angeles law raw rrms. firms. Five rlve cuslomers customers submitted suomrfteo tner their oroers orders at tne the beginning Degmnmg oI of and are as follows. Schedule the jobs as per i) EDD rule ii) SPT rule and

\f\; \\

-k\

;"fu-

Job 0n order of arrival ) Processins Time (Davs) Due date (Davs hence)

A

B

C

D

E

a J

4

6

2

1

5

6

7

9

2 (10 Marks)

w

'q'

**x**

3

of3

For More Question Papers Visit - www.pediawikiblog.com

rilltr(

## Operations Research Jan 2016 (2010 Scheme).pdf

Following data fer. a. Draw the ... by simplex / Big-M method? If yes, ... You are given the following data regarding the processing times of some jobs on three.

#### Recommend Documents

Operations Research Jan 2016 (2010 Scheme).pdf
... so that the S total production and transportation cost is minimum. (12 Marks). | 23 4. 2 4 6 t1. 10 8 7 5. 13 J 9 t2 ... and M3 cannot be placed at A. The assignment cost of machine i to place j in rupees (1000) ... by simplex / Big-M method?

Mechatronics & Microprocessor Jan 2016 (2010 Scheme).pdf ...
Expiain static and dynamic characteristics of sensors. Explain workirlg principle of Hall effect sensor. Deftne following terms: i) Hysteresis error. ii) Repeatability.

Paratransit Research Subcommittee Minutes Jan 2010.pdf ...
Paratransit Research Subcommittee Minutes Jan 2010.pdf. Paratransit Research Subcommittee Minutes Jan 2010.pdf. Open. Extract. Open with. Sign In.

Non Conventional Energy Sources Jan 2016 (2010 Scheme).pdf ...
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Main menu.

Power Electronics Jan 2016 (2010 Scheme).pdf
Z b. Explain the working of single phase semiconvert with neai circuit and waveforms. Derive ... Effiin the working of transistorized current source inverter.

Hydraulics & Pneumatics Jan 2016 (2010 Scheme).pdf
cylinder using a 412 solonoid acfuated spring retum cylinder. ^&-, (10 Marks). b. Explain the cylinder pneumatic circuit and its motion control diagraqffi (10 Marks).

Advanced Concrete Technology Jan 2016 (2010 Scheme).pdf ...
Page 1 of 2. USN 10cv81. Eighth Semester B.E. Degree Examination, Dec.2015 I J an.20l6. Advanced Goncrete Technology. Time: 3 hrs. Max. Marks:100.

Programming in C++ Jan 2016 (2010 Scheme).pdf
i) # define square(x) x * x. void main( ) ... Describe hase class access control with an example. b. ... Displaying Programming in C++ Jan 2016 (2010 Scheme).pdf.

Computer Networks 2 Jan 2016 (2010 Scheme).pdf
Try one of the apps below to open or edit this item. Computer Networks 2 Jan 2016 (2010 Scheme).pdf. Computer Networks 2 Jan 2016 (2010 Scheme).pdf.

Programming the Web Jan 2016 (2010 Scheme).pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Main menu.

Operating Systems Jan 2016 (2010 Scheme).pdf
Starting from the current head position, what is theWll distance traveled (in cy.lrndgf\$).rb1,,:;i_r.; ... Displaying Operating Systems Jan 2016 (2010 Scheme).pdf.

Transportation Engineering 2 Jan 2016 (2010 Scheme).pdf ...
suitable site for airport in view of criteria. (10 Marks). optimum airport capacity. ... by adopting holding apron near exit taxiway draw a neat sketch and explain.