Roll No.
Total No. of Questions : 07
B.Com(Sem.–3rd)
OPERATION
RESEARCH
Subject
Code : BCOP-304
Paper
ID : [B1127]
Time : 3 Hrs.
INSTRUCTION TO CANDIDATES :
1.
Section –A, is Compulsory.
2.
Attempt any four questions from Section-B.
Section
–A
1.
Explain any five techniques of
operation research.
2.
What do you understand by slack
variable?
3.
Write the dual of the following
LP problem
Max Z =
x1-x2+3x3
X1+x2+x3<10
2x1-x3<2
2x1-2x2+3x3<6
X1,x2,x3>0
4.
What do you mean by saddle
point?
5.
Calculate E.O.Q –
Annual demand -2500 Units
Carrying cost =25%
Unit cost = Rs.100/-
Ordering Cost Rs.100 per order.
6.
Find IBFS by lowest cost Entry
method-
W1 W2 W3 W4 supply
P1 2 3 11 7 60
P2 1 0 6 1 10
P3 5 8 15 9 100
Demand 70 50 30 20 170
7.
What do you understand by
Earliest Finish time and latest finish time?
8.
Solve the following game by
odds method-
B1 b2
A1 1 5
A2 4 2
9. There are eight jobs to be
processed through a single machine. The operation time for each job given
below:
Jobs
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
Operation time (in
minutes)
|
12
|
24
|
16
|
8
|
20
|
22
|
17
|
9
|
Find
out optimal sequence only.
10.
State three applications of
game theory in marketing
Section-B
2.
Solve by simplex method-
Maximise Z = 3x1+4x2+6x3
Subject to = 4x1+x2+6x<960
5x3+3x2+x3<640
X1+2x2+3x3<320
X1,x2,x3>0
3.
what are the important techniques used in operations research ? explain their
limitations.
4.The
characteristics of a project schedule a are as given below:
Activity
1-2
1-3
2-4
3-4
3-5
|
Time (days)
4
1
1
1
6
|
Activity
4-9
5-6
5-7
6-8
7-8
8-10
9-10
|
Time (days)
5
4
8
1
2
5
7
|
i)
Construct a PERT network
ii)
Find the Critical path.
iii)
Compute Earliest and latest
expected time for each event.
5. i) Explain the dominance principle in game
theory using following example-
FIRM
B
B1 B2 B3 B4
A1 35 65 25 5
A2 30 20 15 0
A3 40 50 0 10
A4 55 60 10 15
ii)
Solve the following assignment problem
1 2 3 4
A 2 10 9 7
B 15 4 14 8
C 13 14 16 11
D 4 15 13 9
6.
explain the economic order quantity model? What are its assumptions? What are
the practical limitations is using this formula?
7.
a manufacturer wants to ship 8 loads of his product as shown below. The matrix
gives the kilometres from origin t destination.
Destination
A B C
AVAILABILITY
Origin
X 50 30 220 1
Y 90 45 170 3
Z 50 200 50 4
DEMAND 3 3 2 8
Shipping
costs are Rs. 10 per load per kilometre. What shipping schedule should be used.
Apply MoDi method.
0 comments:
Post a Comment
North India Campus