ASSIGNMENT QUESTIONS

UNIT-I

1. What is operations research? What are the phases involved in operations research?
2. Solve the following LPP using Simplex method
Max z = 5x1+3x2

S to C : x1 + x2 ≤ 2

5x1+ 2x2 ≤ 10

3x1+ 8x2 ≤ 12

And x1,x2 ≥ 0
3. Solve the following LPP by graphical method
Max Z = 3 x 1 + 4 x 2
Subject to: x 1 + x 2 ≤ 450
2 x1 + x 2 ≤ 600
x 1 , x 2 ≥0

4. A Company making cool drinks has Two bottling plants located at two towns T1 and T2 . Each
plant produces three drinks A, B and C and their production
Cool Plants
drinks
T1 T2

A 6000 2000

B 1000 2500

C 3000 3000

The marketing department of the company forecasts a demand of 80000 bottles of A,

22000 bottles of B , 40000 bottles of C during the month of June. The operating costs per day at T1
and T2 are Rs. 6000 and Rs. 4000 respectively. Find graphically, the number of days for which plant
must be run in June so as to minimize the operating costs while meeting the market demand.

(5). Apply the two phase simplex method to solve the following LPP
Max Z = 5 x 1 - 4 x 2 + 3 x 3
Subject to: 2 x1 + x 2 +6 x 3= 20
6 x 1 + 5 x 2 +10 x 3 ≤ 76
8 x 1 + 3 x 2 + 6 x 3 ≤ 50
x 1 , x 2 , x 3≥ 0
 UNIT-II

1. A company has four factories from which it ships its product units to four ware houses which are
the distribution centres. Transportation cost per unit between various combinations of factories and
ware houses are as:

Factory Warehouses Available

1 2 3 4

1 48 60 56 58 140

2 45 55 53 60 260

3 50 65 60 62 360

4 52 64 55 61 220

Requirement 200 320 250 210

Find the optimal solution which minimizes the distribution cost.

2. The supply and demand of units of a company is given in the following table with unit cost
Warehouses

W1 W2 W3 W4 Capacities

Factories F1 19 30 50 12 7

F2 70 30 40 60 10

F3 40 10 60 20 18

Requirements 5 8 7 15 35/35

Find the Optimal solution using VAM-SS(Stepping Stone ) Method.

3. Five contractors have submitted tenders to take up 5 projects advertised .It is noted that one
contractor can be assigned one job as other wise the time for completion and the quality of work ship
will be affected. The estimates of cost in thousands rupees given by each of them are indicated
bellow.

Project→ 1 2 3 4 5

Contractor↓

A 41 72 39 52 25

B 22 29 49 65 89

C 27 39 60 65 81

D 45 50 48 52 37

E 29 40 39 26 30
Find the assignment such that the total cost of completing the five projects is minimum. What is the
minimum cost?

4. A Department head has four subordinates and four tasks to be performed. The subordinate differ in
efficiency and the tasks differ intrinsic difficulty .The estimate the time each man would be take to
perform each task is given in the matrix below

Men

Tasks E F G H

A 18 26 17 11

B 13 28 14 26

C 38 19 18 15

D 19 26 24 10

How should the tasks be allocated , one to man. So as to minimize the total man hours?

5. i) What is a degeneracy in T.P. How to resolve the degeneracy in T.P.

ii) Write a short notes on travelling sales men problem.

UNIT-III
1. There is 5 jobs each of which must go through the 2 machines A and B in the order AB. Processing
times are given below .Determine a sequence of 5 jobs that will minimize the elapsed time T.
Calculate the total idle time for the machines in this period.
Processing time (Hrs)

Job 1 2 3 4 5
Time for A 3 7 4 5 7
Time for B 6 2 7 3 4
2. There are 5 jobs each of which is to be processed through 3 machines A,B and C in the ordered
ABC. Processing times in hours are

Jobs A B C
1 3 4 7
2 8 5 9
3 7 1 5
4 5 2 6
5 4 3 10
Determine the optimum sequence for the 5 jobs and the minimum elapsed time. Also find the idle
time for the 3 machines and waiting time for the jobs.
3. We have 5 jobs each of which must go through the machines A, B and C in the order ABC.

Job 1 2 3 4 5
Machine A 5 7 6 9 5
Machine B 2 1 4 5 3
Machine C 3 7 5 6 7
Determine a sequence for the jobs that will minimize the total elapsed time and idle time for each
machine.
4. Explain the johnson’s algorithm for n jobs 2 machines.
5. A firm is considering replacement of a machine cost price is Rs. 12,200 and the scrap value is
Rs.200. the maintenance cost are found from experience to the as follows
 Year 1 2 3 4 5 6 7 8
Main cost 200 500 800 1200 1800 2500 3200 4000
When should the machine be replaced ?

6. The initial cost of an item is 15,000 and maintenance and running costs in rupees for different years
are given below

Year: 1 2 3 4 5 6 7

Running Cost: 2500 3000 4000 5000 6500 8000 10000

What is the replacement policy to be adopted if the capital is worth 10% and there is no salvage
value.

UNIT-IV

1. i. What are the Characteristics of Game?

ii. Briefly explain “dominance property”
2. Find the (i).best strategy for player A
(II). best strategy for player b
(III).The value of the game to the following problem.
Player B
B1 B2 B3
A1 15 2 3
Player A A2 6 5 7
A3 -7 4 0
3. In a game of matching coins with two players suppose one player wins Rs.5 when there are 2
heads and wins nothing when there are two tails, and tosses Rs.2 when there are one head and
one tail. Determine the pay – off matrix the best strategies for each player and value of the
game.
4. Two competitors A and B are competing for the same product. Their different strategies are
given in the following pay off matrix

Company B

I II III IV

I 3 2 4 0

II 3 4 2 4
Company A
III 4 2 4 0

IV 0 4 0 8

Use dominance principle to find the optimal strategies.

5. A manufacturer has to supply his customer with 600 units of his products per year. Shortages are
not allowed and storage costs amount of 60 paisa per unit per year. The set up cost per one is
[Link]
(i).The economic order quantity
(ii).The minimum average yearly cost
(iii).The optimum no. of orders per year
6. A manufacturer has to supply his customers 24000 units of his product per year . The demand is
fixed and known. The customer has no storage space and so the manufacturer has to ship a day’s
supply each day. If the manufacturer fails to supply, the penalty Rs.0.2 per unit per month. The
inventory holding costs amounts to Rs.0.1per unit per month and the setup cost is Rs.350 per
production run. Find the optimum lot size for the manufacturer.

7. If a product is to be manufactured within the company , the details are as follows

Annual demand rate =36000 units, Production rate =72000 units Setup cost = Rs.250 per
setup, Carrying Cost =Rs.25/unit/year. Find the EOQ .

8. A Contractor has to supply 10000 bearings per day to an automobile manufacturer. He finds that
when he starts production run, he can produce 25,000 bearings per day. The cost of holding a
bearing in stock for a year is Rs.2 and the setup cost of a production run is [Link]
frequently should production run be made? Also find production run time and total variable
cost.(Assume 300 days in the year).

UNIT-V

1. i. What are the Elements of a Queuing system?

ii. Explain the Queue Discipline with suitable examples.
iii. Write short notes on Queuing Models.

2. A Department store has a single cashier . During the rush hour customers arrive at the rate of 30
customers per hour. The average [Link] customers that can be processed by the cashier is 40 per hour.
Assume Poisson arrival ,exponential distribution and FCFS queue discipline .Find

i) What is the probability that cashier idle?

ii) What is the average [Link] customers in the queuing system.
iii) What is the average [Link] customers in the queue.
iv) What is the average time a customers spends in the system.
v) What is the average time a customers spends in the queue waiting for service ?

3. The arrival at an ATM centre are assumed to be exponentially distributed .The arrival rate is 4 per
hour and service rate is 12 per hour. Determine
i. Average [Link] customers waiting for the service.
ii. Average [Link] customers in the waiting in the system.
iii. Average time that a customer will spend in the system.
iv. Average time that a customer has to wait before getting service.

4. Explain the characteristics of Dynamic programming problem.

5. Explain the Bellman’s Principle of optimality.
6. Solve the following LPP by using Dynamic programming
Max Z = 8 x 1 + 7 x 2
Subject to: 2 x1 + x 2 ≤ 8
5 x 1 + 2 x 2 ≤ 15
x 1 , x 2 ≥0
7. Solve the following LPP by using Dynamic programming
Max Z = 2 x1 + 4 x 2
Subject to: 2 x1 + 3 x 2 ≤ 48
x 1 + 3 x 2 ≤ 42
x 1 + x 2 ≤ 21
x 1 , x 2 ≥0
8. Find the shortest path from A to E in the following network using Dynamic Program

D1 D2 E1
C1 C2
B1 B2 B3
C1 - 2 D1 3
B1 3 4
A 2 2 2
C2 5 3 D2 4
B2 4 -

B3 5 2

9. What is Simulation? What are the advantages and disadvantages of Simulation?

10. A company manufactures around 150 mopeds. The daily production varies from 146 to 154
depending on the variability of raw materials and other working conditions:

Production per day 146 147 148 149 150 151 152 153 154

Probability 0.04 0.09 0.12 0.14 0.11 0.10 0.20 0.12 0.08

The finished mopeds are transported in a specially arranged lorry accommodating only 150 mopeds.
Using the following random numbers 80, 81, 76, 75, 64, 43, 18, 26, 10, 12, 65, 68, 69, 61, 57 simulate
the process to find out:
(i) What will be the average number of mopeds waiting in the factory?
(ii) What will be average number of empty spaces in the lorry?