You are on page 1of 4

Name :

/q
p:/
htt

Roll No. : ...


Invigilator's Signature : .

CS/B.Tech/(ME)/(PE)/SEM-7/ME-703/2012-13

2012
OPERATION RESEARCH &
INDUSTRIAL MANAGEMENT

Time Allotted : 3 Hours

Full Marks : 70

The figures in the margin indicate full marks.

pap

Candidates are required to give their answers in their own words


as far as practicable.
GROUP A
( Multiple Choice Type Questions )
Choose the correct alternatives for the following : 10
i)

ii)

7413

1 = 10

Marketing activities are related to


a)

make more profit

b)

even more revenue

c)

earn customer's satisfaction

d)

all of these.

Management is the art of


a)

profit making

b)

getting things done by people

c)

satisfying the competitors

d)

satisfying customers.

in
a c.
ut .

iii)

wb
er.

1.

If the input decrease decreases while the output remain


constant, what will happen to productivity
a)

it will decrease

b)

it will increase

c)

it will remain same

d)

all of these.

[ Turn over

CS/B.Tech/(ME)/(PE)/SEM-7/ME-703/2012-13

iv)

In inventory control, EQB stands for

/q
p:/
htt
v)

vi)

Economic Order Quantity

b)

Exact Order Quantity

c)

Expected Order Quantity

d)

Exceed Order Quantity.

Breakeven point is where


a)

Total revenue > Total cost

b)

Total revenue < Total cost

c)

Total revenue = Total cost

d)

All of these.

The assignment matrix is

pap

vii)

a)

a)

identity matrix

b)

null matrix

c)

square matrix

d)

rectangular matrix.

The solution to a transportation problem with m


rowsand n column is feassible if the number of positive
allocation is
m+n

c)

wb
er.

a)

b)

m+n1

d)

m + n + 1.

viii) Queuing theory deals with problem of

x)

7413

material handling

b)

effective use of machines

c)

reduce the waiting time or idle time

d)

better utilization of man services.

CPM has the following time estimate

in
a c.
ut .

ix)

a)

a)

one time estimate

b)

two time estimate

c)

three time estimate

d)

four time estimate.

Dual simplex is the technique


a)

Which start from the infeasible solution

b)

Which has basic operations similar to simplex

c)

In which simplex is used on the duel from of


primal

d)

All of these.
2

CS/B.Tech/(ME)/(PE)/SEM-7/ME-703/2012-13

/q
p:/
htt

GROUP B
( Short Answer Type Questions )
Answer any three of the following.

5 = 15

Out the purpose of Slack variables and artificial variables


used in LLP problem. What is degeneracy in Linear
Programming problem ?

3.

What are the objectives of administration ?


between policies, procedure and methods.

4.

What is Monte Carle Simulation ? Discuss various steps


involved in Monte Carle Simulation Monte Carle Simulation.
State the area of application of it.

5.

Write the Dual of the following LP Problem :

pap

2.

Distinguish

Maximize Z = x 1 x 2 + x 3

Subject to constrain x 1 + x 2 + x 3
2

wb
er.

2x 1 x 3

10

2x 1 2x 2 3x 3

when x 1 , x 2 and x 3

GROUP C
( Long Answer Type Questions )
Answer any three of the following.
a)

Use graphical method to solve the


problem :

15 = 45

following

LP

in
a c.
ut .

6.

Where Maximize Z = 15x 1 + 10x 2


Subject to constrains 4x 1 + 6x 2
3x 1

180

5x 2

200

when x 1 , x 2
7413

360

[ Turn over

CS/B.Tech/(ME)/(PE)/SEM-7/ME-703/2012-13

b)

/q
p:/
htt

Apply Vogel's approximation method to find the optimal


transportation Costfor the following problem.
8
D1
D2
D3
D4
Supply

7.

19

30

50

10

70

40

60

S3

40

70

20

18

Demand

14

a)

What is the significance of scientific selection of


industrial Personal ?
3

b)

Explain the following term with an example.


i)

Direct cost

ii)

Indirect expenses

iii)

Factory overhead

iv)

Depreciation value

v)

What is meant by breakeven analysis and discuss


advantage and limitation of it.
4

wb
er.

a)

pap

8.

S1
S2

Solve the following linear programming problem using


Big M method :
9
Maximize Z = 5x 1 + 3x 2
Subject to constrains 2x 1 + 4x 2 12
2x 1 + x 2 = 10
5x 1 + 2x 2 10

when x 1 and x 2

9.

in
a c.
ut .

b)

0.

State the advantage and the limitation of game theory.

Solve the linear programming problem by simplex method :


Maximize Z = 5x 1 + 3x 2 + 7x 3
Subject to constrain x 1 + 2x 2 + 2x 3
3x 1 + 2x 2 + x 3

22
26

x 1 + x 2 + x 3 18
when x 1 , x 2 and x 3

7413

0.