TYBMS OPERATION RESEARCH PROF PARTH CHITALIA

TYBMS - Assignment for Operation Research – SEM VI

UNIT 1 Introduction of OR & LPP

Q.1 Explain the Features of Operation Research
Q.2 Explain the research methodology of Operation Research

Q.3 An investor is considering investing in two securities A and B .the risk and return associated with these
securities is different. Security A gives return of 9% and has risk factor 5 on scale of zero to 10. Security B
gives return of 15% but has risk factor of 8. Total amount to be invested Rs 5, 00,000. Total minimum
returns on the investments should be 12 5. Maximum combined risk not is more then 6. Formulate LPP.
Q.4 Mr. Akshay wants to invest in to two mutual funds A & B. his total investment is Rs. 1, 00,000 and not
more than Rs. 7,00,000 will be invested in a single fund. Fund A gives return of 15% p.a 7 fun B gives
returns of 20% p.a. the risk taking factor rating on a scale of 0-10 are, for A-4 and for B-8. Minimum
desired returns are 17.5% and maximum tolerable risk factor is 6 for Mr. Akshay. Formulate LPP
Q.5 United fabrications make two types of automobile parts say A and B. It buys castings that are to be
machined, bored and polished. The capacity of machining is 25 per hour for A and 40 per hour for B and
capacity of boring is 28 per hour for A and 35 per hour for B and the capacity for polishing is 35 per hour
for A and 25 per hour for B casting for part A costs Rs.2 each and for B they cost Rs.3 each. They sell for
Rs.5 and Rs.6 respectively. The three machines have running cost of Rs.20, Rs. 14 and rs.17.5 per hour.
Assuming that any combination of parts A and B can be sold, what product mix maximizes the profit?
Formulate it as a linear programming problem and solve graphically.
Q.6 Padma ltd. makes three different kinds of chairs. All can be made profitably in this company, but the
company’s monthly production is constrained by the limited amount of labor, wood and screws available
each month. The director will choose the combination of chairs that maximize his revenue in view of the
information given in the following table:

Input Arm Chair Executive Officer chair Monthly availability

chair
Labour (hours) 12 7 9 1260

Wood (board feets) 22 18 16 19008

Screw(kg) 2 4 3 396

Selling price (in Rs.) 4000 2000 5000 ------

Formulate the above problem as a linear programming problem solve it by simplex method
Q.7 Use simplex method to show that the following linear programming prolem is temporarily degenerate:
Maximize Z = 9X1+4X2
Subject to the constraints,
4X1+3X2 <12

4X1+X2 < 8
X1, X2 > 0

1
TYBMS OPERATION RESEARCH PROF PARTH CHITALIA
UNIT II ASSIGNMENT & TRANSPORTATION PROBLEM
Q.1 Rakesh nagiria and associates, an engineering company is engaged in consultancy for 4 types of jobs,
employing 4 consultant engineers on daily payment basis to finished the job. Are different for different
engineers. As per the employment conditions only one type of job is to be given to one engineer. The
engineer is paid for full day even if he works for a part of the day. Find the least cost allocation jobs to
engineers for the following data:

Engineer Rate per day (100rs) No of jobs finished Job types No. of jobs
per day

M 5 12 W 190

N 6 14 X 170

O 3 8 Y 145

P 4 10 Z 190

If one of the engineer is to be replaced, which engineer is to be marked for replacement and why?
Q.2 An engineering company has branches in Mumbai, Calcutta, Delhi and Nagpur. A branch manager is to
be appointed one at each city, out of 4
candidates A, B, C and D. Depending on Branch City
the branch manager and the city, the Manager
Mumbai Calcutta Delhi Nagpur
monthly business in the city varies in
lakhs of rupees as per details below: A 2 3 1 1
Suggest which manager should be B 5 8 3 3
assigned to which city so as to get
maximum total monthly business. C 4 9 5 1

D 8 7 8 4

Q.3 A company is spending Rs.1200 on transportation of finished goods from three plants to four
distribution centres every month with Distribution Centres Monthly capacities
unit cost of transportation are given in
the following table D1 D2 D3 D4 (Units)
a) Find the optimal solution to F1 20 30 50 15 7
give minimum cost schedule to
transport finished goods to F2 70 35 40 60 10
market.
b) What can be the maximum F3 40 12 60 25 18
savings every month by optimal
Demand 5 8 7 15 35
scheduling?

Q.4 Explain the differentiation between Assignment & Transportation Problem.

Q.5 Explain the Hungarian Methods of Assignment Problems.
Q.6 Explain the Different methods of Transportation Methods.

2
TYBMS OPERATION RESEARCH PROF PARTH CHITALIA
UNIT III Networking (CPM PERT & CRASHING)
Q.1 A small assembly plant assembles PC’S through 9 interlinked activities. The time duration which is
given below

Activity 1-2 1-3 1-4 2-5 3-6 3-7 4-6 5-8 6-9 7-8 8-9

Duration (hrs) 2 2 1 4 8 5 3 1 5 4 3

1) Draw a network diagram for it

2) Calculate or tabulate for each activity. Earliest start (ES), earliest finished (EF), latest start (LS) and
Latest Finished (LF) times
3) Find critical and sub critical paths
4) Calculate and tabulate total float, free float, interfering float and independent float.
Q.2 Following are the details of estimated times of activities for a certain project

Activity A B C D E F

Immediate Predecessor --- A A B,C --- E

Estimated Time(weeks) 2 3 4 6 2 8

1) Find the critical path and expected time of the project

2) Calculate the earliest start time and earliest finish time for each activity
3) Calculate the slack for each activity.
Q.3 What is meant by critical path in a network?
Q.4 The time and the cost estimates and precedence relationships of different activities constituting a project
are given below

Intermediate Time (days) Direct cost (Rs)

Activity Predecessor(s) Normal Crash Normal Crash

A ---- 4 3 60 90
B ---- 6 4 150 250
C ---- 2 1 38 60
D A 5 3 150 250
E C 2 2 100 100

F A 7 5 115 175
G D,E,F 4 2 100 240

Indirect cost varies as follows

Days 15 14 13 12 11 10 9 8 7 6

Cost(Rs) 600 500 400 250 175 100 75 50 35 25

3
TYBMS OPERATION RESEARCH PROF PARTH CHITALIA
a) Draw an arrow diagram for the project
b) Determine the project duration which will return in minimum total project cost
c) Is minimum project completion time different from optimal project completion time?

Q.5 M/s Motwani limited have taken up a special project consisting of 10 activities whose three point time
estimates are listed in the table below. Activities are marked with their node numbers

Activity Time Estimates in weeks

Optimistic Most likely Pessimistic

1-2 1 2 3
1-3 1 2 3
1-4 1 2 3
2-5 4 9 20
3-5 2 5 14
3-7 3 6 15
5-7 1 2 9
4-6 2 4 6
6-7 3 3 3
7-8 4 4 4

a) Draw network diagram and find expected completion time of project

b) Identify critical path
c) Find the probability that the project is completed in 17 weeks
d) What is the probability that the project will not be completed in 20 weeks?
e) If the project includes a penalty clause of Rs.1000 per week for any delay beyond 19 weeks. What is the
probability of paying a penalty of more than Rs, 5000?
f) If the project manager wants to complete the project with 95% confidence of completion?
g) If the project manager wants to complete the project with 95% confidence in 21 weeks, by how much
time should he crash the average project completion time?

Q.6 What are the different between CPM and PERT.

Q.7 Explain PERT algorithm for Project.
Q.8 Explain the Concepts :- EFT ; LFT ; Slack ; Independence ; Interfering ; EST ; LST

UNIT IV GAME THEORY & SEQUENCING THEORY

Q.1 Explain the concepts:-

Players ; Strategies ;Play ; Payoff ; Payoff Matrix ;Row Minima ; Column Maxima ; Saddle Point

4
TYBMS OPERATION RESEARCH PROF PARTH CHITALIA

Q.2 Find the optimal strategies for firms A and B in the following game. Also find the value of the game

Firm B

I II III

Firm A I 220 150 170

II -50 40 -20

III 140 120 100

Q.3 Find the optimal strategies for firms Alpha and Beta in the following game. Also find the value of
game.

Beta

I II III

Alpha I -100 -50 70

II -50 40 -200

III 100 120 150

Q.4 Six jobs I, II, III, IV, V, VI are to be processed on two machines. A and B in the order AB.

Processing Time (Min)

Jobs Machine A Machine B

I 5 8

II 2 6

III 10 3

IV 9 4

V 6 3

VI 8 9

Find:-

a) Total elapsed time (minimum)

b) Idle time for each machine

5
TYBMS OPERATION RESEARCH PROF PARTH CHITALIA
Q.5 Five jobs I, II, III, IV, V are to be processed on three machines. A, B and C in the order ABC

Processing Time (Min)

Jobs Machine A Machine B Machine C

I 22 21 23

II 25 22 24

III 23 19 22

IV 22 20 25

V 24 19 20

Find:- Total elapsed time (minimum). Idle time for each machine A, B, C

Q.6 Explain the concepts: - Processing Time; Processing Order; Elapsed Time; Idle Time; Job Sequence.

--------------------------------- ALL THE BEST ------------------------------