P. 1
MG 1401 OPERATION RESEARCH

# MG 1401 OPERATION RESEARCH

|Views: 503|Likes:

See more
See less

11/11/2012

pdf

text

original

# MG 1401 OPERATION RESEARCH

KINGS
COLLEGE OF ENGINEERING

DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING

QUESTION BANK
NAME OF THE SUBJECT: MG 1401 OPERATION RESEARCH YEAR / SEM: IV / VII

UNIT- I LINEAR PROGRAMMING(LP)
PART- A ( 2 MARKS)
1. What is operations research? 2. Define a feasible region. 3. Define a feasible solution. 4. Define optimal solution. 5. What is the difference between feasible solution and basic feasible solution? 6. Define unbounded solution. 7. What are the two forms of a LPP? 8. What do you mean by standard form of LPP? 9. What do you mean by canonical form of LPP? 10. What are the limitations of LPP? 11. What are the slack and surplus variables? 12. What is meant by optimality? 13. Define artificial variable. 14. What are the methods used to solve an LPP involving artificial variables? 15. What is degeneracy?

PART- B
1. (a) Explain the scope of OR. (b) List the phases of OR and explain them. (8) (8)

KINGS COLLEGE OF ENGINEERING, PUNALKULAM

1

x3 ≥ 0 KINGS COLLEGE OF ENGINEERING. TRANSPORTATION MODEL AND ASSIGNMENT MODEL PART. x3 ≥0 (16) (16) (16) (16) UNIT. x1. x 2 . x1. x2 ≥0 7. x2. x3 ≥0 9. 8x1-3x2+6x3 ≤ 50. Write the dual of the following primal LP problem. 3x1+2x2≤ 24 x1+x2 ≥3. x1.MG 1401 OPERATION RESEARCH 6. 2.II DUALITY. 6x1+x2+6x3 ≥ 12. Max Z = x1+2x2+x3 2 x1 + x 2 − x3 ≤ 2 Subject to − 2 x1 + x 2 − 5 x3 ≥ −6 4 x1 + x 2 + x3 ≤ 6 x1 . Use Two Phase Simplex method to Maximize Z = 5x1-4x2+3x3 Subject to the constraints 2x1+x2-6x3 = 20. x1. x2. 3x1+4x2≥ 12. 6x1+5x2+10x3 ≤ 76.A (2 MARKS) 1. x2 ≥0 8. Use Big M method to Maximize Z = 3x1+2x2 Subject to the constraints 2x1+x2≤ 2. Define dual of LPP. Use Two Phase Simplex Method to Maximize Z = -4x1-3x2-9x3 Subject to the constraints 2x1+4x2+6x3≥15. Use Penalty method Maximize Z = 6x1+4x2 Subject to the constraints 2x1+3x2≤ 30. PUNALKULAM 3 .

What do you understand by transportation problem? 6.How do you convert the unbalanced T.MG 1401 OPERATION RESEARCH 3. 4.State the difference between the T. Use dual simplex method to solve the LPP Maximize Z = -2x1-x3 Subject to the constraints x1+x2-x3≥ 5. What do you mean by an unbalanced T. 4x1+x2≥ 4 x1. x1. 13.What is an assignment problem? 11.P? 8.How do you convert the maximization assignment problem into a minimization one? 15. What do you mean by degeneracy in a T. 7.P into a balanced one? 10. x1-2x2+4x3 ≥8.What do you mean by an an unbalanced assignment problem? 12. State the optimality condition in dual simplex method. What is the difference between regular simplex method and dual simplex method? 5. List any three approaches used with T.What is the objective of the travelling salesman problem? 14. PUNALKULAM 4 . x3 ≥0 (16) 4.P? 9. Solve by Dual simplex method the following LPP Minimize Z = 5x1+6x2 Subject to the constraints x1+x2≥2.P and A.(a) Determine an initial basic feasible solution to the following transportation problem using NWCR (8) D1 O1 O2 O3 6 8 4 D2 4 9 3 10 D3 1 2 6 15 D4 5 7 2 4 Supply 14 16 5 35 Required 6 KINGS COLLEGE OF ENGINEERING.P for determining the starting solution. x+2y ≥10 . What is the name of the method used in getting the optimum assignment? PART-B 1. x2. Find the maximum of Z = 6x+8y subject to 5x+2y ≤ 20 .P.y ≥ 0 by Solving its dual problem. x. x2 ≥0 (16) (16) 3. 2.

Solve the following transportation problem starting with the initial solution obtained by VAM (16) D1 O1 O2 O3 2 10 7 D2 2 8 6 3 D3 2 5 6 4 D4 1 4 8 4 Supply 3 7 5 15 Required 4 KINGS COLLEGE OF ENGINEERING. Obtain an initial basic feasible solution to the following TP using VAM D1 O1 O2 O3 11 16 21 D2 13 18 24 225 D3 17 14 13 275 D4 14 10 10 250 Supply 250 300 400 950 Demand 200 6. PUNALKULAM 5 .MG 1401 OPERATION RESEARCH (b) Obtain an initial basic feasible solution to the following TP using Matrix minima method D1 D2 D3 D4 Supply O1 O2 O3 1 4 0 2 3 2 6 3 2 2 8 4 0 1 6 6 8 10 24 (16) (8) Required 4 5.

What are the advantages of Dynamic programming? 6 KINGS COLLEGE OF ENGINEERING.II INTEGER DYNAMIC PROGRAMMING PART. The unit cost of the transportation is given in the following table X A B C 8 3 11 7 8 3 Y 3 9 5 Z Find the allocation so that the total transportation cost is minimum.Y. and C . A company has 3 plants A. Where is branch and bound method used? What is dynamic programming? Define the terms in dynamic programming : stage. 10. three warehouses X.B. A company has 4 machines to do 3 jobs. (16) 8.  (16) 10 15 19 22        UNIT. 12. 5. State Bellman’s principle of optimality.80.state variables Give a few applications of DPP. A number of units available at the plants is 60. The cost of each job on each machine is given below. PUNALKULAM .MG 1401 OPERATION RESEARCH 7. 7. state . What are the methods used in solving IPP Explain Gomorian constraint (or) Fractional Cut constraint. Determine the 18 24 28 32     8 13 17 18  job assignments which will minimize the total cost. 3.Z are 50. 6.Z.80 respectively. 11. Define a mixed integer programming problem.80 and the demand at X.Y. 4. 13. What do you mean by integer programming problem? Define a pure integer programming problem. Each job can be assigned to one and only one machine.A (2 MARKS) 1. Differentiate between pure and mixed IPP. 8. 2.70.

Find an optimum integer solution to the following LPP Maximize Z = x1+2x2 Subject to the constraints 2x2≤ 7. Minimize Z = 3x1+2. Solve the following integer programming problem Maximize Z = 2x1+20 x2-10x3 Subject to the constraints 2x1+20x2+4x3 ≤15. 6x1+20x2+4x3 =20. x2 ≥0 . x1. x2≤ 2 x1. PUNALKULAM 7 . x1+x2≤ 7 2x2≤ 11 x1. x2 are integers 3. Solve the following all integer programming problem using the Branch and bound method.MG 1401 OPERATION RESEARCH PART – B 1. x2 are nonnegative integers (16) 5.5x2 Subject to the constraints x1+2x2≥20. Use Branch and Bound technique to solve the following Maximize Z = x1+4x2 Subject to the constraints 2x1+4x2≤ 7. x2 ≥0 . x1. 5x1+3x2≤15 x1. Solve the following mixed integer programming problem by using Gomory’s cutting plane method Maximize Z = x1+x2 Subject to the constraints 3x1+2x2≤ 5. x2 ≥0 and are integers (16) KINGS COLLEGE OF ENGINEERING. 3x1+2x2≥ 50 and x1. x3 ≥0 and are integers (16) (16) 4. x2. x1 is an integer (16) 2.

The estimated probability distribution of potential sales of the strawberries before spoilage differ among four stores. His estimates of grades he may get by studying are as follows Study X Y Z days/ course 0 1 2 1 1 2 2 2 2 2 4 4 3 4 5 4 (16) How should he plan to study so that he maximizes the sum of his grades? 7. For administrative reasons. A student has to take examination in three courses X. He feels it would be best to devote a whole day to study the same course. The following table gives the estimated total expected profit at each store when various number of crates are allocated to it. However. He has three days available for study.Y. PUNALKULAM 8 . he is willing to distribute zero crates to any of his stores. so that he may study a course for one day.MG 1401 OPERATION RESEARCH 6. the owner does not wish to split crates between stores. The owner of a chain of four grocery stores has purchased six crates of fresh strawberries. Find the allocation of six crates to four stores so as to maximize the expected profit Stores Number of Crates 1 2 3 4 0 1 2 3 4 5 6 0 4 6 7 7 7 7 0 2 4 6 8 9 10 0 6 8 8 8 8 8 0 2 3 4 4 4 4 (16) KINGS COLLEGE OF ENGINEERING.two days or three days or not at all.Z.

Define critical activity and critical path. Define a game. Define saddle point 12. PUNALKULAM 9 .IV PROJECT MANAGEMENT AND THEORY OF GAMES PART. Use dynamic programming to solve the following LPP Maximize Z = x1+9x2 Subject to the constraints 2x1+x2≤25 x2≤11. x2 ≥0 (16) UNIT. Define pure and mixed strategies. Define strategy. What are the three types of float? 3. A project schedule has the following characteristics Activity 1-2 1-3 2-4 3-4 3-5 4-9 5-6 5-7 Time(days) 4 1 1 1 6 5 4 8 Activity 6-8 7-8 8-10 9-10 Time(days) 1 2 5 7 From the above table (1) Construct a network diagram (2) Compute the earliest event time and latest event time (3) Determine the critical path and total project duration (4) Compute total float. 6. free float for each activity. Define two person zero sum game. 4. When do players apply mixed strategies? PART – B 1. What is a network? 2. x1. 8. Define crash time and crash cost 7. Define the cost time slope of an activity. Distinguish between PERT and CPM 5. 9.MG 1401 OPERATION RESEARCH 8. (16) KINGS COLLEGE OF ENGINEERING. 10.A (2 MARKS) 1. 11.

A project has the following activities and other characteristics: Estimated Duration (in weeks) Activity (i-j) 1-2 1-3 1-4 2-5 3-5 4-6 5-6 Optimistic Most likely 1 1 2 1 2 2 3 1 4 2 1 5 5 6 Pessimistic 7 7 8 1 14 8 15 What is the expected project length? What is the probability that the project will be completed no more than 4 weeks later than expected time? (16) 3.H D (i) Find the critical path (ii) Find the total float and the free float for each non-critical activity 4.L K 4 L 2 M 2 I.MG 1401 OPERATION RESEARCH 2.G. A small maintenance project consists of the following jobs whose precedence relationships is given below Job 1-2 1-3 2-3 2-5 3-4 3-6 4-5 4-6 5-6 6-7 14 (16) Duration 15 15 3 5 8 12 1 14 3 (days) (i) Draw an arrow diagram representing the project (ii) Find the total float for each activity (iii) Find the critical path and the total project duration (16) KINGS COLLEGE OF ENGINEERING.L (i) (ii) Immediate E Predecessors C. Activity Duration A 4 B 2 A C 1 B D 12 K E 14 F 2 E G 3 F H 2 F I 4 F J 3 I. PUNALKULAM 10 . Listed in the table are the activities and sequencing requirements necessary for the completion of research report.

PUNALKULAM 11 .The following table shows the jobs of a network along with their time estimates Job 1-2 1-6 2 5 14 2-3 2 14 26 2-4 2 5 8 3-5 7 10 19 4-5 5 5 17 6-7 5 8 29 5-8 3 3 9 7-8 8 17 32 a(days) 1 m(days) 7 b(days) 13 Draw the project network and find the probability that the project is completed in 40 days. (16) 7. (16) 6. (ii)Find the critical path (iii) Find the probability that the project is completed in 31 days.MG 1401 OPERATION RESEARCH 5. The following table shows the jobs of a network along with their time estimates Job 1-2 1-6 2 5 14 2-3 6 12 30 2-4 2 5 8 3-5 5 11 17 4-5 3 6 15 5-8 1 4 7 6-7 3 9 27 7-8 4 19 28 a(days) 3 m(days) 6 b(days) 15 (i)Draw the project network. A small project is composed of seven activities whose time estimates are listed in the table as follows: Estimated duration (weeks) Optimistic Most likely Pessimistic 1 1 7 1 4 7 2 2 8 1 1 1 2 5 14 2 5 8 3 6 15 Activity 1-2 1-3 2-4 2-5 3-5 4-6 5-6 (i) (ii) (iii) Draw the project network Calculate the variance and standard deviation of project length What is the probability that the project will be completed 4 weeks earlier than expected? (16) KINGS COLLEGE OF ENGINEERING.

The carrying cost per unit per year is 30% of the unit cost. PUNALKULAM (8) (8) 12 .A (2 MARKS) 1.400. The ordering cost is Rs. 100 per order. Define the following (1) Balking (2) Reneging (3) Jockeying PART – B 1. Explain Kendall’s notation. The holding cost is Rs1. Distinguish between deterministic model and probabilistic model 6. The ordering cost per order is Rs. 10. Define buffer stock or safety stock.MG 1401 OPERATION RESEARCH UNIT .100 per year.00.15 and the holding cost is Rs.Write Little’ formula 12. (i) Find the EOQ (ii) By using better organizational methods the ordering cost per order is brought to Rs. What are the different costs that are involved in the inventory problem? 3. What are the basic characteristics of a queuing system? 9. 5. KINGS COLLEGE OF ENGINEERING. ordering one month’s usage at a time.15 and the carrying charges are 15% of the average inventory per year. The cost of placing one order is Rs. Briefly explain probabilistic inventory model. 11. but the same quantity as determined above were ordered.80 per order. Define transient and steady state. (a) The demand for an item is 18000 units per year. You have been asked to suggest a more economical purchasing policy for the company. Define holding cost and setup cost 4.10.20 per unit time and the cost of shortage is Rs. (a) A company purchases 9000 parts of a machine for its annual requirement.80. The cost per unit is Rs. What advice would you offer and how much would it save the company per year? (8) (b) The annual requirement for a product is 3000 units.5. The production cost is Rs. (iii) If a new EOQ is found by using the ordered cost as Rs. Define a queue 8. 7.6000 and the cost of one shortage is Rs. Each part cost Rs. (b) The demand for an item is 12000 per year and the shortage is allowed. What is meant by inventory? 2.20 per year per unit determine the optimum total yearly cost.00. what would be further savings in cost? (8) 2. If the unit cost is Rs. Assuming that replacement rate is instantaneous determine the optimum order quantity.V INVENTORY CONTROL AND QUEUING PART .20.

MG 1401 OPERATION RESEARCH 3 (a) The annual consumption of an item is 2000 items. The ordering cost is Rs. Customers arrive at a one window drive in bank according to Poisson distribution with mean 10 per hour. Assuming working days as 200 lead time 20 days. between one arrival and the next. (iii) In the above model λ=10/hour. Arrivals of a telephone booth are considered to be poisson with an average time of 10 min. (c) Reorder level. Calculate (a) EOQ (b) the number of orders per year. By how much the flow of arrivals should increase in order to justify a second booth? (iii) What is the average length of the queue that forms time to time? (iv) What is the probability that it will take him more than 10 minutes altogether to wait for the phone and complete his call? 5. µ=3/hour C=4. (16) (16) (16) KINGS COLLEGE OF ENGINEERING. (i) Write the steady-state equation for the model (M/M/C):(FIFO/∞/∞) (ii) Obtain the expected waiting time of a customer in the queue of the above model. The length of a phone call is assumed to be distributed exponentially with mean 3 min. (d) the total annual ordering and carrying cost. and safety stock 100 units. PUNALKULAM 13 . (b) The following table gives the distributions for lead time and daily demand during the lead time. Others can wait outside this space? (i) What is the probability that an arriving customer can drive directly to the space in front of the window? (ii) What is the probability that an arriving customer will have to wait outside the indicated space? (iii) How long is an arriving customer expected to wait before starting service. for phone. what is the probability that a customer has to wait before he gets service? 6. Determine the buffer stock. L (days) 3 4 5 6 7 8 9 10 Frequency(f) 2 3 4 4 2 2 2 1 Demand Frequency 0 2 1 4 2 5 3 5 4 4 5 2 6 1 7 2 (8) (8) 4. The carrying cost is Rs0. when convinced that an arrival has to wait on the average for at least 3 min. (i) What is the probability that a person arriving at the booth will have to wait? (ii) The telephone department will install a second booth.100 per order.80 per unit per year. The space in front of the window including that for the serviced car can accommodate a maximum of 3 cars. Service time per customer is exponential with mean 5 minutes.

(c) If a customer has to wait find the expected length of his waiting time. Calculate (i) The probability that the yard is empty. The service times follow the exponential distribution with a mean of 4 min and cars arrive for service in a poisson process at the rate of 10 cars per hour. Assume that the inter arrival time follows an exponential distribution and the service time is also to be assumed as exponential with mean of 36 minutes. What is the expected number of customers in the shop? (8) (8) (10) (6) (16) (8) (8) KINGS COLLEGE OF ENGINEERING. he will leave. the average arrival rate of customer is 10 every 30 minutes following Poisson process. Further. PUNALKULAM 14 . 10. What proportion of time the pumps remain idle? (b) A barber shop has two barbers and three chairs for customers.MG 1401 OPERATION RESEARCH 7. (a) In a railway marshalling yard. Find the probability that a customer has to wait for service. (a) In a supermarket. If there is just one phone. if a customer arrives and there are no empty chairs in the shop. How many cars are in the park on the average? 9. goods train arrive at the rate of 30 trains per day.5 minutes following exponential distribution. The arrival of cars is Poisson at a mean rate of 10 per hour. (b) A car park contains 5 cars. A call on the average takes 3 minutes. If the service time for each customer is exponential with mean 4 minutes and if people arrive in a Poisson fashion at the counter at the rate of 10 per hour. The average time taken b y a cashier to list and calculate the customer’s purchase is 2. The length of time each car spends in the car park is exponential distribution with mean of 5 hours. Assume that the customers arrive in Poisson fashion at a rate of 5 per hour and that each barber services customers according to an exponential distribution with mean 15 minutes. then calculate (a) The probability of having to wait for service. (a) A petrol pump station has 2 pumps. find (i) the expected number of callers in the booth at any time (ii) the proportion of the time the booth is expected to be idle? 8. (b) the expected percentage of idle time for each girl. A super market has two girls ringing up sales at the counters. (ii) The average queue length assuming that the line capacity of the yard is 9 trains. What is the probability that the queue length exceeds 6? What is the expected time spent by a customer in the system? (b) In a public telephone booth the arrivals are on the average 15 per hour.

scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->