1. All questions are compulsory in section I and 2. Attempt any 3 from section II 3. Normal distribution table is attached.

Section I Q.1) answer the following questions briefly a) (15)

What are the components of formulation of linear programming problems?

b) What is an assignment problem? How will you deal with assignment problem where some assignments are prohibited? c) Name any 3 methods of finding initial basic feasible solution for the transportation problems. Which one of them is best and why? d) e) Distinguish between PERT and CPM network. Give one application of CPM network What are the objectives of project crashing?

Q.2) from the following data, determine:I. II. Normal project duration and cost Optimal project completion time and cost 1-2 4-6 5-6 3 6 1800 2 4 1900 100 1200 1000 1500 900 60 6 1000 4 400 2 1500 4 300 8 6 5 4 1-3 3-5 3-6 2-4 2

Activity -5 4-5

Normal time(week) 13 2 2 Normal cost (Rs.) 120 700 350 Crash time (weeks) 10 1 1 Crash cost (Rs.) 140 800 450

The indirect cost of the project is Rs.90/week If it is necessary to complete the project in 17 weeks, at what cost it could be achieved ? Section II

Q.3) a company which manufactures three products A,B and C requiring two resources labor and materials and want to determine the optimal product mix that maximizes profit the following linear program was formulated to answer this:Maximize Z = 3 X1 + X2+5X3 Subject to 3X1+4X2+5X3 <=30 6x1+3x2+5X3 <=45 (material) (labor)

Where x1, x2, x3 are the units of products A, B, C product. Find the optimum product mix. (10) Q.4) the Indian navy wishes to assign 4 ships to patrol 4 sectors of the sea. In some areas ships are to be on the lookout for illegal fishing boats, and in other sectors to watch for enemy submarines, so the commander rates each ship in terms of its probable efficiency in each sector. These relative efficiencies are given in the table below:Ship 1 2 3 4 A 20 60 80 65 B 60 30 100 80 C 50 80 90 75 D 55 75 80 70

On the basis of the rating shown , the commander wants to determine the patrols assignments producing the greatest over all efficiencies what is the optimal assignment ? (10) Q.5) given elow is a table taken from the solution process for a transportation problems. Cost per unit (in Rs.) Distribution centre factory A B C Demand 1 10 12 8 7000 7000 2 8 5000 13 10 500 5500 3 7 6 4500 12 4500 4 12 10 1500 14 1500 3000 availability 5000 6000 9000

Answer the following question and answer briefly a) b) c) d) Is this solution feasible? Is this solution degenerate? Is the solution optimum? If not find the optimum solution. Does the problem have alternative optimum solutions?

Q.6) a farm owner is considering drilling a well. In the past only 85% of the wells had yielded water at a depth of 250 feet in the area. On the finding, no water at a depth of 250feets some persons drilled further down up to 300 feet but only 25% struck water at the depth. The cost of drilling Is Rs.35/foot. The farmer estimates that if he does not have his own well he will be have to pay Rs.15000 over the next 10yrs.(in PV terms) to buy water from a neighbor. The following decision could be optimal. a) b) c) Do not drill a well Drill up to 250 feet If no water is found at 250 feet drill upto 300 feet

d) Draw a decision tree to represent the situation and determine the farm owners strategy under the EMV approach (10)

activity 1-2 1-3 1-4 2-5 3-5 4-6 5-6

Three time (estimated week) 1-1-7 1-4-7 2-2-8 1-1-1 2-5-14 2-5-8 3-6-15

Draw the project network a) b) c) d) Find the expected duration and variation for each activity. Find SD of project length What is the probability that the projected will be completed in 20 weeks or less? What should be the project due date so that probability of achieving it is 95%

Theory QuestionsChp. Operations Research 1) OR and its characteristics 2) Applications of OR 3) Limitations of OR Chp. LPP 1) Infeasibility 2) Unboundedness 3) Alternative/Multiple Optimal solution 4) Degeneracy 5) Feasible solution 6) Unique optimal solution 7) Post-optimality analysis/ Sensitivity analysis 8 ) Unrestricted variables 9) Steps in formulation of LPP 10) ISO profit line 11) in LPP simplex table, what does basis consist of ? 12) What do the values in index (Aj-Cj-Zj) row communicate? 13) Shadow price and its application 14) Artificial variables 15) Basic variables in simplex 16) Diff b/w simplex and dual simplex method 17) Uses of slack, surplus 18 ) Dist b/w degeneracy and cycling 19) Importance of dual simplex method 20) Advantages of duality 21) LPP and its application 22) Components of LPP 23) Graphical method of solution 24) Assumptions of LPP 25) Advantages and disadvantages of LPP 26) Big M-method Chp. Network Analysis 1) PERT-Advantages and disadvantages 2) Project 3) Activities 4) Events/Nodes 5) Network 6) Dummy activity and its use 7) Critical paths necessary and sufficient conditions 8 ) Sub-critical path 9) Float and its types 10) Explain with reference to PERT-optimistic time, most likely time and pessimistic time OR 3 estimates and relationship with expected time and its variance in the project 11) Forward and Backward pass uses 12) Dangling event

13) Updating of network in PERT,CPM 14) Uses of slack, float 15) Indirect costs in a project 16) Compare PERT n CPM 17) Time Cost trade off in CPM 18 ) Steps in PERT, CPM 19) Crashing 20) In what type of projects, the activity time required is probabilistic and how this is converted into estimated expected time? 21) Utility of total float in project monitoring Chp. Assignment problem 1) Assignment problem 2)Restricted assignment problem 3) Multiple optimal solutions 4) Unbalanced assignment problem 5) State the algorithm of solving an assignment problem OR procedure of Hungarian method 6) Regret matrix 7) Reduced matrix 8 ) Principle behind balanced assignment problem 9) Methods of Assignment 10) Special problems in Assignment 11) How do you prepare Balanced maximisation problem with restrictions for Hungarian method? Chp. Transportation problem 1) Basic and non-basic variables 2) Transportation problem 3) Optimal solution 4) Degeneracy 5) Unbalanced transportation problem 6) Prohibited transportation problem 7) Independent cells 8 ) Looping 9) Least cost method 10) North west corner rule 11) Compare Transportion and Assignment problem 12) Test for optimality 13) Significance of Time minimisation 14) State the various methods of finding the Basic Feasible solution in Transportation problem and compare them 15) What principle is applied to prevent a prohibited route being a part of transportation solution? These questions carry 2-3 marks weightage. Questions :1. Operations Research Introduction, Models, Areas of Application.

2. 3. 4. 5. 6. 7. 8. 9.

Linear Programming Problems Mathematical Formulation of Linear Programming Problem Graphical and Simplex Method of LPP Concept of slack, surplus and artificial variables in LPP Manual solutions of LPP upto 3 iterations Minimization and Maximization Problems in LPP Alternative Optima in LPP Unbounded solutions in LPP

10. Infeasible solutions to be shown graphically and also by simplex method in LPP 11. Definition of Transportation model 12. Balanced/Unbalanced in transportation model 13. Minimisation / Maximisation in Transportaion model 14. Determinants of the initial basic feasible solution using North-West Corner Rule method in Transportation 15. Least cost method in Transportation 16. Vogels Approximation method for balanced and unbalanced transportation problems 17. Optimality Test & obtaining of optimal solution in Transportation(Considering per unit transportation cost) 18. Assignment Problem in Transportation 19. Hungarian Method in Transportation 20. Statement of Transportation and Assignment Problem as L.P Problems 21. Construction of Network Rules and Precautions. 22. CPM and PERT Networks 23. Obtaining of Critical Path and Time estimates for activities 24. Probability of completion of project. 25. Determination of floats (total, free, independent & interfering)

26. Crashing of Simple networks 27. Decision Environments risk & uncertainty. Payoff table, Regret table. 28. Decision making under uncertainty Maximin & maximax criteria 29. Minimax Regret criterion 30. Laplace criterion 31. Hurwicz criterion 32. Expected Monetary Value criterion. 33. Expected Value of Perfect Information (E.V.P.I) 34. Expected Opportunity Loss (E.O.L). 35. Decision Tree (Simple examples) Problems/Sums are expected based on the above topics.