7/26/2019 mba -OR- 2016

1/3

GKM COLLEGE OF ENGINEERING & TECHNOLOGYDEPARTMENT OF MBA

MODEL EXAM

SUB CODE : BA7206 Time : H!"SUB#ECT : A$$%ie O$e!'(i)* Re"e'!+, M'!-" : .00

PART / A .0 X 2 1 20

ANS3ER ALL 4UESTIONS

1. Write down the standard form of a Linear programming Problem.2. List the application of Operation research model.3. Distinguish between transportation & assignment Problem.4. What do ou understand b !ra"elling #alesman Problem$%. Define i'ed #trateg in a game.(. What is meant b mi'ed integer programming problem$). *ame the in"entor odel adopted in practice.+. Define simulation.,. What is meant b group replacement Polic$1-.List the component of a ueueing sstem.

PART / B 5 X .6 1 0ANS3ER THE FOLLO3ING X .0 1 0

11. /a0 firm produces two products. !hese products are processors on machines.!he time reuired to manufacture one of each products and the dail capacit ofthe machines are gi"en below

t is reuired to determine the dail number of units to be manufactured for eachproduct. !he profit per unit for products is s.2%-5 s.44- . t is assumed that all theproducts produced are consumed in the mar6et. 7ormulate LP model ma'imi8e thedail profit also determine the optimum solution

/1(0/or0

(b) #ol"e the following LPP a' 9 : 4;1< %;2= 3;3

#tc 3;1< % ;2 = 2 ;3 > (-1-;1< );2< 4;3 > 1--

;15 ;25 ;3? - /1(0

achinesachine capacitinutes @ daProduct1

Product2

123

4%4

%3(

3(4+4%

7/26/2019 mba -OR- 2016

2/3

12 /a0 7ind the basic feasible solution of the following transportation problem andalso find the Optimal transportation plan /1(0

1 2 3 4 5 available

A 4 3 1 2 6 80

B 5 2 3 4 5 60

C 3 5 6 3 2 40D 2 4 4 5 3 20

Required 60 60 30 40 10

(or)/b0 /i0 A'plain !ransshipment model. /40

/ii0 compan has surplus truc6 in each of the cities 5 B5 C5 Dand A and one deficit truc6 in each of the cities 15253545% and(. the distance between the cities in 6ilometers in shown inmatri' below. 7ind the assignment to truc6s from cities insurplus to cities in deficit so that the total distance co"ered b

"ehicle is minimum. /120 I II III IV V VI

A 12 10 15 22 18 8

B 10 18 25 15 16 12

C 11 10 3 8 5 9

D 6 14 10 13 13 12

E 8 11 11 13 10

13 /a0 /i0 sol"e the following 2 ' n game b method of sub game /+0

!la"er B

B1 B2 B3!la"er A A1 1 3 11

A2 8 5 2 /ii0 educe the following game b dominance propert and sol"e it /+0

/or0

/b0 #ol"e the following nteger LPP

a' 9 : 1-;1 3-;2#tc

3- ;1 1-;2< 2- ;3 > )-= 2-;1< 4- ;2 > 12- ;15 ;25 ? - and are integers /1(0

I 2 3 4 5

I 1 3 2 4

II 3 4 1 5 6

III 6 5 6 5

IV 2 1 6 3 1

7/26/2019 mba -OR- 2016

3/3

14. /a0 /i0 A'plain decision ma6ing under uncertaint /40 /ii0 compan has a demand of 125--- unit @ ear for an item and it canproduct 2--- such items per month. !he cost of one setup is s.4-- and the holdingcost @ unit@ month is s.%-. find the optimal lot si8e and the total cost per ear5assuming cost of one unit as s.%. also find the ma'imum in"entor5 manufacturingtime and total time. /120

/or0

/b0 /i0 Discuss the different models of Decision ma6ing theor /40 /ii0 7ind the accurate demand so that the compan can able to a"oid the loss inselling a particular article whose cost price is s.2% and its selling price is s.3-.

lso its AE5 AEP and A'pected Loss table for the following data

Demand 1- 11 12 13 14 1%Probabilit -.1% -.2 -.3 -.-% -.1% -.1% /120

1%. /a0 #hips arri"e at a port at the rate of one in e"er 4 hours with e'ponentialdistribution of inter arri"al times. !he time as ship occupies a berth for unloading hase'ponential distribution with a a"erage of 1- hours. f the a"erage delas of shipswaiting for berths is to be 6ept below 14 hours.7ind /i0 *umber of ships waiting in the berths and /ii0 finds its time for unloading it

/iii0 Fow man berths should be pro"ided at the port $/i"0 find the dle time. /1(0

/or0

/b0 !he cost of machines is s.(1--- and its scrap "alue is s.11-- themaintenance costs found from e'perience are as follow and rate of interest1-G.

Hear 1 2 3 4 % ( ) +aintenance 3-- 4%- (-- +-- 1--- 12-- 1%-- 2---

When should the machine be replaced.$ /1(0

IIIIIIIIIIIIII