KALOL INSTITUTE OF TECHNOLOGY & RESEARCH CENTRE, KALOL QUESTION BANK-I (Examples/Problems) MODELING SIMULATION & OPERATION RESEARCH

(BE 6th Semester IT) [161601]

MODULE 8: Replacement & Maintenance Problem Q-1

Determine the age at which the following type of machine be replaced: Cost price = Rs 8,000 Operating Costs = Rs 1000 for the first Year, increasing by Rs 500 every Year Resale Value = Rs 4000 for first Year, decreasing by Rs 500 every year. [N D Vohra Unsolved Q-3 Page-594][Solution: 4 Years]

Q-2

A machine costs Rs. 10,000. The following table shows the scrap value of the machine at the end of different years and its maintenance cost up to the end of the given year. You are required to find the economical year of replacement Year Maintenance Cost Scrap Value 1 500 5000 2 500 4500 3 600 3500 4 650 3000 5 700 2500 6 800 2500

Q-3

Akshar Chem. Pvt. Ltd. has installed 10,000 light bulbs in the factory. The manager of the purchase department has studied the past record that is given in the table below. Individual cost of replacing a bulb is Rs. 1.00 while group replacement of all the bulbs costs Rs.0.35 per bulb. You are required to advise him an optimal policy that minimizes cost on the company. [In the case of your advising for the group replacement, suggest the proper period also.] Week 1 2 3 4 5 Probability of failure 0.03 0.07 0.20 0.40 0.15 during the week

Q-4

A firm is considering replacement of machine whose cost price is Rs.12, 200 and scrap value is Rs.200. The maintenance cost are as follows: Year 1 2 3 4 5 6 7 8 Maintenance 200 500 800 1200 1800 2500 3200 4000 Cost (Rs.) [N D Vohra Unsolved Q-4 Page-594][Solution: 6 Years]

MODULE 7: Computer Modelling & Simulation Q-1

A bakery keeps stock of a popular brand of cakes. Previous experience shows the daily demand pattern for the item with associated probabilities, as given: Daily demand (Nos.) 0 10 20 30 40 50 Probability 0.01 0.20 0.15 0.50 0.12 0.02 Use following sequence of Random number to simulate the demand for next 10 days. Also find Average demand per day. Random Numbers: 25, 39, 65, 76, 12, 05, 73, 89, 19, 49 [N D Vohra Unsolved Q-2 Page-907][Solution: 24 Units] A confectioner sells confectionery items. Past data of demand per week in hundred kilograms with frequency is given below: Demand/Week 0 5 10 15 20 25 Frequency 2 11 8 21 5 3 Using the following sequence of random number, generate the demand for next 15 weeks. Also find average demand per week. Random numbers: 35, 52, 90, 13, 23, 73, 34, 57, 35, 83, 94, 56, 67, 66, 60 [N D Vohra Unsolved Q-3 Page-907][Solution: 12.6 Units] A bakery item store gets a supply of fresh loaves in the early morning. He keeps a record of 25 days of the number of loaves received and sold each day. Simulate this for a further period of 6 days. You are required to generate a complete record of units received and sold each day. Day 1 2 3 4 5 6 7 8 9 10 11 12 13 Receipt 11 10 9 9 11 12 9 11 12 9 8 9 10 Sold 10 10 8 8 9 11 9 10 11 9 8 8 9 You are required to use the following random numbers.( The first six of the numbers for first run and the remaining six for the second run.) Random Numbers: 22 09 12 67 89 47 55 56 02 34 56 35

Q-2

Q-3

Q-4

Power Corporation manufactures two-wheelers powered by either a system of photocell units or run on battery system. The circumstance like short supply of raw material, power cut, and extreme cold weather conditions, is liable to variation in the production. The units produced at the end of a day are transported to the warehouse by a specially designed lorry having a capacity to carry 50 two wheelers. A track of last 100 days record of production is as follows. Simulate this for next 6 days. Generate a report showing the status of twowheelers.[ Either empty space left in the lorry or some two-wheelers left-over on premises of the factory or balance on both sides. Use the random numbers 23 67 79 98 07 56 ] Production Days 48 12 49 15 50 35 51 25 52 08 53 05

Q-5

Software made by a company XYZ is to be tested at two testing centre: Centre A Centre

B. Software will go for testing at A first and then B. The probability distribution for the testing time for software, in each centre is given below. Using simulation, determine the number of software could be tested in the testing centre. The random numbers are: 49, 83, 11, 19, 97, 74, 27, 61, 50, and 8. Testing Centre A Testing Centre B Testing Time (min) Probability Testing Time (min) Probability 10 0.2 8 0.3 11 0.3 9 0.4 12 0.4 10 0.3 13 0.1 -

MODULE 6: Queuing Models Q-1

A dispatcher of the polish department has received four requests for police assistance. Currently, six patrol-cars are available for assignment and the estimated response time (in minutes) are shown in the table that follows: Incident Patrol Unit 1 2 3 4 5 6 6 5 3 4 5 6 I 8 6 2 3 7 6 II 4 4 7 6 5 5 III 3 7 9 8 4 7 IV (a) Which Patrol units should respond? (b) What will be the average response time? A foreign bank is considering opening a drive-in window for customer service. Management estimates that customers will arrive for service at the rate of 12 per hour. The teller, whom it is considering to staff the window, can serve customers at the rate of one every three minutes. Assuming Poisson arrivals and exponential service, fine (i) utilization of teller, (ii) average number in the system, (iii) average waiting time in the line, and (iv) average waiting time in the system. [N D Vohra Unsolved Q-6 Page-562][Solution: 60%, 1.5, 0.075, 0.125] The Hi-power Company provides electric power, supplied by four big generators, to an industrial area. The generators are subject to an occasional breakdown and, from the past data, it is known that a generator develops problem, on an average, once in every 12 months. The company has a repair crew which is entrusted with task of repairing the faulty generators. From the past records, it is known that it takes 2 months, on an average, for a generator to be repaired. Calculate (a) The proportion of time there shall be no generators to be repaired. (b) The average number of generators waiting repairs (c) The average waiting time for repair of a defective generator to begin. [N D Vohra Unsolved Q-21 Page-565][Solution: 0.47, 0.29, 0.091 year] The inter arrival rate of customers at a gas-station, following a Poisson distribution, is 12 per hour. The inter-service rate, following Poisson distribution, averages to 3 minutes / customer. Answer the following questions. 1) What is the traffic intensity of the system? 2) What is the probability that a new entrant gets immediate service? 3) How many customers are there in the system?

Q-2

Q-3

Q-4

Q-5

Q-6

A researcher studying the Q theory at a counter of a railway station has concluded that the inter-arrival rate at a desk is 3 minutes while the inter-service, both following poisson distribution, is 2 minutes. Answer the following questions using the given facts. 1) What is the average waiting time of a customer in the system? 2) How many customers are there waiting in the queue? 3) The management is ready to start a new counter if the average waiting time in the system is 8 minutes; find the arrival rate ( per hour) of the customers A typist at an office of a company receives on the average 20 letters per day for typing. The typist work 8 hours a day and it takes on the average 20 minutes to type a letter. The cost of the letter waiting to be mailed is Rs. 0.80 per hour and the cost of the equipment plus salary of the typist is Rs. 45 per day. What is the average numbers of letters to be typed and to be mailed? In order to improve the typing service, the company has the choice to take lease of
one of the two models of an automated typewriter. The daily cost and the resulting increase in efficiency of the typist are given below. What action should the company take to minimize the total daily cost of waiting letters to be mailed?

Q-7

Q-8

Q-9

Increase in Typists Efficiency 50% 75% [N D Vohra Solved Ex: 10.15] A self service store employs one cashier at its counter. An average of nine customers arrive every 5 minutes while the cashier can serve 10 customers in 5 minutes. Assuming Poisson distribution for arrival rate and exponential distribution for service rate, find a) Avg. number of customer in the system. b) Avg. number of customer in queue or average queue length. c) Avg. time a customer spends in the system. d) Avg. time a customer waits before being served. At a certain petrol pump, customers arrive in a Poisson process with an average time of 5 minutes between successive arrivals. The time taken at the petrol pump to serve the customers follows exponential distribution with an average of the 2 minutes. Calculate : (a) Arrival and Service rate. (b) The utilization parameter. (c) Probability that there shall be four customers in the system. (d) Probability that there are more than four customers in the system. [N D Vohra Unsolved Q-1 Page-561][Solution: 30, 0.40, 0.01536, 0.01024] If on an average 10 customers join a queue in one hour and the average service time per customers is 6 minutes, then the average waiting time of new arrival in single server queuing is one hour. Answer weather the statement is True, False or cant say with proper justification.

Model I II

Additional Cost per day Rs. 37 Rs. 39

MODULE 4 & 5: Network Analysis Q-1

A small project consist of seven activities for which the relevant data are given below: Activity Preceding Activities Activity Duration(Days)

A B C D E F G

A, B A, B C, D, E C, D, E

4 7 6 5 7 7 5

(i) Draw the network and find the project completion time (ii) Calculate total float for each of the activities Q-2 Solve the minimum-span problem for the network given below (Show all step separately.)

Q-3

Given that a project involves activities A, B, C, , I; each requiring completion time, in days, as per the following table: Activity A B C D E F G H I Duration 23 8 20 16 24 18 19 4 10 Given that activity A precedes D and E; activities B and D precede activity F; activity C precedes G; activities B and G precedes H, and activities F and G precede I, draw network and calculate: (i) Total Float, (ii) Free float, (iii) Independent float, (iv) Critical Path, and (v) Project Completion time.

Q-4

(a) For an activity in a PERT network, the following information is available: Expected time = 9.5 days Optimistic time = 5 days Variance = 6.25day2 Calculate most likely and pessimistic times of this activity (b) The critical activities of a project , their expected duration and standard deviations (in weeks) are given here: Activity B E G H K L Expected Duration 12 3 8 7 5 6 Standard Deviation 2/3 1/3 2 5/3 4/3 0 (i) Find the probability that the project will be completed in 45 weeks. (ii) If manager wants the probability to be 90 percent of completing the project in time, how many weeks prior to the deadline should she start the project?

Q-5

Q-6

You are given a sequence of activities in the following table. Using the data given in the table, prepare a network diagram. Find the critical path. Activity Immediate Predecessor Duration A 5 B 8 C A 3 D A, B 4 E C 7 F E, D 5 G D 12 H D 5 I F, G 5 J H, I 2 Five cities A, B, C, D, and E are inter-connected by rail lines. The matrix given below shows the distance from one city to another city. You are required to find the shortest route, beginning from any city, which goes to every remaining city and terminates in the city of origin. [You may draw the network.] DISTANCE MATRIX City A B C D A 6 8 7 B 6 10 12 C 8 10 13 D 7 12 13 E 10 11 10 12

Q-7

Using the information given below, design the Pert network diagram. Find the duration and standard deviation of the critical path. Activity (I-J) Optimistic Time Normal Time Pessimistic Time 1-2 2 5 14 1-3 1 2 3 2-3 3 4 11 2-4 2 5 8 3-4 6 7 14 3-5 1 2 3 3-7 3 4 11

4-5 4-6 5-7 6-7

0 5 6 3

0 7 7 4

0 15 14 11

Q-8

Determine the critical path for the following network. What is the total time required for the project. Also find the free float and independent float for each activity. Activity 1-2 1-3 2-4 3-4 3-5 4-6 5-6 Duration 2 8 4 1 2 5 6

Q-9

Udipis is building a new restaurant. In order to complete the following activities, along with their time estimates, are given below. Activity Immediate Optimistic Pessimistic Most Likely Predecessor Time Time Time A 2 8 5 B A 1 9 5 C A 4 9 6 D B, C 2 2 2 E B 1 9 2 F C, D 2 5 4 G E 3 10 8 H F, E 1 3 2 I G, H Draw AOA network. Find the critical path/ paths and expected project duration. Also find the variance for the project duration.

Q-10

Q-11

Q-12

Consider the following data for the activity of the project Activity A B C D E F Imme.Pre A A B, C E Duration 2 3 4 6 2 8 Draw the network and find Forward and backward pass and find the critical path. Do the Resource Allocation process for a project consisting of several activities, duration, required resource of carrying out each of activities and their availabilities as given below: Activities Equipment Operators Duration 1-2 X 30 4 1-3 Y 20 3 1-4 Z 20 6 2-4 X 30 4 2-5 Z 20 8 3-4 Y 20 4 3-5 Y 20 4 4-5 X 30 6 No of operators=50, Equipment X, Y, Z=1 [N D Vohra Solved Ex: 12.8 Pg:634] Find the Shortest path for the given network below, Where ( ) indicates arc length values

Q-13

Find the Maximum Flow from s to t

Q-14

Q-15

Base of PERT Resulting Information is given below : (i) Draw Pert Network. (ii) Calculate expectime and Variance. (iii)The Contract Specifies a Rs. 5000 per day penalty for each day the completion of the project extends beyond 37 days. What is the Probability that this company will have to pay a maximum penalty of Rs. 15000? Activity Immediate Optimistic Most Likely Pessimistic Predecessor Time (Hr) Time (Hr) Time (Hr) A 2 3 4 B 8 8 8 C A 7 9 11 D B 6 6 6 E C 9 10 11 F C 10 14 14 G C, D 11 11 11 H F, G 6 10 10 I E 4 5 5 J I 3 4 4 K H 1 1 1 For the below network diagram. (i)calculate earliest start, earliest finish, latest start, latest finish times for all activities, (ii) Tabulate total float and free float

Q-16

A project with the following six activities is listed with the normal time period for completion of each activity. Draw the network diagram and find out the critical path. Also prove that an activity C is critical activity using early and late start and finish timings. Activity A B C D E F Imm, Pre A A B C D, E Time 4 8 8 5 7 5

MODULE 3: Transportation & Assignment Problem Q-1

Solve the following transportation Problem From To

Availability 4 12 9 13 8 13 12 14 7 7 10 6 5 6

1 1 2 3 4 5 6 Demand 8 6 10 6 11 8 9

2 8 9 15 8 10 14 10

3 5 11 6 7 11 5 8

[N D Vohra Unsolved Q-4 Pg:272][Solution: 336] Q-2 Sales manager of ABC Corporation is thinking of assigning exactly one of the five districts to a salesman from a team of five salesmen. His objective is to maximize the sum of the total profit earned by them. The following matrix of past records is taken as the base for decision-making. PROFIT MATRIX District 1 2 3 4 A 800 800 900 950 B 900 950 1000 950

Q-3

Q-4

Q-5

Q-6

Q-7

C 1100 1000 1100 1000 D 1000 850 1200 1100 E 950 900 900 1000 You are required to make the assignment Solve the following transportation problem using Vogels Approximation Method Transportation rate/ unit ---Matrix To D1 D2 D3 D4 Available Units F1 10 9 11 10 200 F2 12 10 8 7 60 F3 8 9 11 12 40 Demand 100 50 60 40 [D stand for destination. F stands for Factory] Solve the transportation problem using Least Cost Method ( Matrix Minima Method) and North West corner Rule and find the difference in the final answer of the costs. To D1 D2 D3 D4 F1 12 15 10 9 F2 9 12 11 10 F3 10 10 7 12 DEMAND 100 150 50 150 [ D STANDS FOR DESTINATION AND F STANDS FOR MANUFACTURING UNIT.] Four software programs A, B, C and D are to be assigned to programmers W, X, Y, and Z. All the programmers are capable in their programming skills, except that programmer W could not program software B; programmer X could not program software D; programmer Y could not program software A. the cost of assigning the software to programmers are given in the cost matrix. Determine the optimum assignment W X Y Z A 5 4 5 B 9 7 3 C 2 4 3 5 D 9 7 8 The following indicates the allocation values, shown in the boxes during and iteration of the transportation problem. i) Test for its optimality. ii) Determine the optimum total transportation cost D E F A 4 4 3 35 B 5 1 6 5 20 C 8 3 2 40 There are three warehouses X, Y, and Z having capacities 40, 30 and80 units of a product. Supply have to be effected from these warehouses to three regions A, B, and C with demand of 50 units each and where it could be sold at the unit prices Rs. 100, Rs. 140 and Rs. 120 respectively. The costs of transportation per unit are given in the following matrix. Determine the optimum distribution to maximize the total profit, if the production cost per unit is Rs. 50

X Y Z

A 10 20 30

B 20 30 20

C 10 20 10

Q-8

Q-9

Q-10

Q-11

Q-12

There are four salesmen A, B, C and D and four areas W, X, Y, and Z where any one could be assigned. The expected profit that the company could get by assigning the salesman to area is given in the profit matrix. Determine the optimum assignment to maximize the total profit W X Y Z A 10 5 13 15 B 3 9 18 3 C 10 7 2 2 D 5 11 9 7 Solve the transportation problem (find initial basic solution with VAM and Optimal Solution using MODI method) D1 D2 D3 D4 Supply S1 21 16 25 13 11 S2 17 18 14 23 13 S3 32 27 18 41 19 Demand 6 10 12 15 Find the Optimal solution for the following assignment Problem I II III IV V A 11 17 8 16 20 B 9 7 12 6 15 C 13 16 15 12 16 D 21 24 17 28 26 E 14 10 12 11 15 The table below records transportation cost per unit of a product from origins O1,O2,O3,O4 to destinations D1,D2,D3,D4 and D5. The capacities of the four origins are respectively 55,45,30,50 while the requirements of the five destinations are respectively 40,20,50,30,40 employing the vogels approximations method. Make the initial to the origin to satisfy the requirement of the destinations and test the optimality of these allocations. Use Modified Distributions method (MODI) for obtaining optimal solutions also, find the total cost implied by the solution. ORIGIN D1 D2 D3 D4 D5 CAPACITY O1 12 4 9 5 9 55 O2 8 1 6 6 7 45 O3 1 12 4 7 7 30 O4 10 15 6 9 1 50 REQUIREMNT 40 20 50 30 40 Determine an initial basic solution to the following transportation problem by using (a) NWCR (b) LCM (c ) VAM D1 D2 D3 D4 SUPPLY S1 21 16 15 3 11 S2 17 18 14 23 33 S3 32 27 18 41 19 DEMAND 6 10 12 15

Q-13

The following is the information that concerns the operations of the XYZ manufacturing company the productions cost of the company is estimated to be Rs . 5 per unit ______________________________________________________ Month 1 Month2 ___________________________________________________ Units on order 800 1400 Production capacity Regular time 920 920 Over time 250 250 Excess cost/unit (Over time) 1.25 1.25 Storage cost / unit 0.50 0.50 Formulate and sole the above problem as transportations problem

Q-14

A company owns facilities at six places. It has manufacturing plants at places A, B and C with daily production of 50, 40 and 60 units respectively. It has warehouses at three different places P, Q and R with daily demands of 20, 95 and 35 units respectively. Per unit shipping costs are given in the following table. WAREHOUSE P Q R PLANT A 6 4 1 B 3 8 7 C 4 4 2 Solve using LCM

MODULE 2: Linear Programming (LP) Q-1

Solve simplex problem Maximize Z = 7x1 + 14x2 Subject to 3x1 + 2x2 <=36 x1 + 4x2 <=10 x1,x2>=0

[N D Vohra Unsolved Q-2 Pg:132][Solution: Z=70] Q-2

Write a dual of following problem and then solve that dual. Maximize Z = 40x1 + 35x2 Subject to 2x1 + 3x2 <= 60 4x1 + 3x2 <= 96 x1,x2 >= 0 [N D Vohra Solved Pg:145] Solve following problem by Big-M method. Minimize Z = 6x1 + 4x2 Subject to 3x1 + 0.5x2 >= 12 2x1 + x2 >= 16 x1,x2>=0 [N D Vohra Unsolved Q-19 Pg: 136][Solution: Z=48] Solve the problem given below with cutting plane algorithm. Maximize Z = 200x1 + 300x2 Subject to 2x1 + 4x2 <=17 3x1 + 3x2 <=15 x1,x2>=0 and integer Find X1 and X2 so as to maximize Z = 3X1 + 5 X2 , subject to the following constraints. X1 + X2 <= 2 , 4X1 + 5X2 >= 20 , with X1 and X2 >=0. Make your comment on the solution. Write the dual of the problem and solve the dual. Find X1 and X2 so as to maximize Z = 3X1+5 X2 subject to the following constraints. X1 + X2 <=2 , 4X1 + 5X2 >=20 , with X1 and X2 >=0. Make your comment on the solution Give salient features of primal and dual problem of linear programming problem and write the dual of the following problem. [Do not solve the dual.] Maximize z = 2X1 + X3 subject to the following constraints. X1 + X2 + X3 >= 4, X2 + 2 X3 = 6, X1 -- 2X3 <=5 with X2>= 0 and X1 and X3 unrestricted in sign. A chemical mixture consists of three raw materials A, B and C costing Rs. 20, Rs. 30 and Rs. 40 per kg. The specifications of the mixture are as follows: i) The mix must contain at least 20% of B ii) The mix should not contain more than 40% of A iii) The mix must contain at least 10% of C Determine the LP model only, to find the least cost mix for a batch of 1000 kg of the chemical mixture Solve the following LPP using BIG M method. Show your calculation up to three iterations only

Q-3

Q-4

Q-5

Q-6

Q-7

Q-8

Q-9

Q-10

For the following problem formulate its dual and solve the dual problem graphically. Interpret the values of the dual variable with respect to the primal problem

Q-11

Solve the following problem using graphical method

Q-12

Solve the following LPP using Two phase method

Q-13

Q-14

Q-15 Q-16

Q-17

Q-18

A firm manufacture 3 Products A,B and C. The Profits are Rs.3, Rs.2, and Rs.4 respectively. The firm has two machine C and D which requires processing time 4,3,6 and 3,2,4 minutes respectively on each machine for each product. Machine C and D have 2000 and 2500 machine minutes, respectively. The firm must manufacture 100 As, 200 Bs and 500 Cs, but not more than 150 As. Set up linear programming Problem to maximize the profit A manufacture of furniture makes two products chairs and tables. Processing these Products is done on two machine A and B. A chair requires 2 hours on machine A and 6 hours on Machine B. A table requires 5 hours on Machine A and No time on machine B. There are 16 hours of time per day available on Machine A and 30 hours on Machine B. Profit gained by the manufacturer from a Chair and a table is Rs 2 and Rs 10 respectively. Solve this problem graphically to maximize the profit Use simplex method to solve following LPPs Maximize Z = 3X1+2X2 Subject to X1 + X2 <= 4, X1 X2 <=2 X1 >=0 and X2>=0 Use the Graphical Method to solve the following LP problem. Minimize Z = -X1+2X2 Subject to the Constraints 1) X1+3X2 <= 10 2) X1+X2 <= 6 3) X1-X2 <= 2 and X1, X2 >=0 A company makes two kind of leather belts A and B. Belt A is a Higher quality belt and belt B is a lower quality. The respective profits are Rs 4 and Rs 3 per belt. The production of each of type A requires twice as much time as a belt of type B. The company could make 1,000 belts per day. The supply of leather is sufficient for only 800 belts per day( both A and B combined) Belt A required a fancy buckles and only 400 of these are available per day. There are only 700 buckles a day available for belt B. What should be the daily production of daily production of each type of Belts? Formulate a LP and solve it using Simplex method What steps are required in solving linear programming problems by graphical method? Formulate the LP model for the following problem using graphical method to determine as to how many units of each of the products should be produced per

Q-19

week so that the firm can earn the maximum profit. A firm has engaged in producing two products, P1 and P2. Each unit of product P1 requires 4kg of raw material and 6 labour hours for processing, whereas each unit of product P2 requires 3 kg of raw material and 3 hours of labour, of the same type. Every week, the firm has an availability of 90kg of raw material and 96 labour hours. One unit of product P1 gives Rs 60 and one unit of product P2 gives Rs 45 as profit. Solve the following linear programming problem using Simplex method and find an optimal solution. Maximize z = 7x + 14y subject to: 3x + 2y 36 x + 4y 10 and x 0 , y 0

Prepared By: Prof. Lokesh Gagnani (IT Dept)