Operations Research

(Two Marks)

Unit 1
1. What are the scopes or uses or applications of OR? (Pg No. 1)
2. What are the general methods of solving OR? (Pg No. 1)
3. What are the main Phases of OR? (Pg No. 1)
4. What are the Limitations of OR? (Pg No. 2)
5. Mention the steps for Linear Programming Formulation? (4 Marks) (Pg No. 2)
6. Mention the steps for Graphical Method fo the solution of L.P.P? (4 Marks) (Pg No. 2)
7. What are the Limitations of Graphical Method? (Pg No. 10)
8. What is meant by Solution? (Pg No. 14)
9. What is meant by Feasible Solution? (Pg No. 14)
10. What is meant by Optimal Solution? (Pg No. 14)
11. Express the Canonical form of LPP in matrix notation? (Pg No. 15)
12. Mention the characteristics of the canonical form? (Pg No. 15)
13. Express the Standard form of LPP in matrix notation? (Pg No. 16)
14. Mention the characteristics of the Standard form? (Pg No. 16)
15. Express the minimization of a function f(x) in equivalent maximization form? (Pg No. 16)
16. How the inequality in one direction can be converted into inequality in the opposite
direction? (Pg No. 16)
17. How an equality constraints can be expressed as two inequalities? (Pg No. 16)
18. How an inequality constraint with its left hand side in the absolute form can be
expressed as two inequalities? (Pg No. 17)
19. What is meant by basic solution? (Pg No. 17)
20. What is meant by non-basic variables? (Pg No. 17)
21. Define Non-degenerate basic solution? (Pg No. 18)
22. Define degenerate basic solution? (Pg No. 18)
23. Define basic feasible solution? (Pg No. 18)
24. Define unbounded solution? (Pg No. 19)
25. Define feasibility condition? (Pg No. 19)
26. Define optimality condition? (Pg No. 19)
27. Define pivot column or key column? (Pg No. 20)
28. Define key row or pivot equation? (Pg No. 20)
29. Define pivot element or key element or leading element? (Pg No. 20)
30. Write the New element equation?
31. Write the New pivot equation? (Pg No 21)
 32. What are the steps for the maximization problem? (Pg No 21)
33. What are the steps for the minimization problem? (Pg No 21)
34. What are the two methods available for Artificial Variable Techniques) (Pg No 25)
35. When will you say the solution is an optimal basic feasible solution in Big M method? (Pg
No 26)
36. What is meant by Pseudo-optimal solution) (Pg No 26)
37. What are the possibilities arise to solve the auxiliary LPP? (Pg No 26)
38. What are the disadvantages of Big M method over Two phase method?
39. What are the variants to be considered in the simplex method? (Pg No 29)
40. What is meant by degeneracy and when will it arise in a LPP? (Pg No 30)
41. What is meant by Cycling or Circling? (Pg No 30)
42. What are the perturbation rule to avoid cycling? (Pg No 30)

Unit 2:
1. Define primal and dual? (Pg No. 33)
2. Define Symmetric form and unsymmetric form? (Pg No. 33)
3. How to construct the dual problem? (Pg No. 33)
4. What is Unsymmetric form? (Pg No. 37)
5. State the fundamental theorem of duality? (Pg No. 37)
6. State the complementary slackness theorem? (Pg No. 37)
7. Define Leaving Variable? (Pg No. 40)
8. Define Entering Variable? (Pg No. 40)
9. Write the mathematical formulation of a Transportation problem? (Pg No. 41)
10. Define basic feasible solution? (Pg No. 42)
11. What is meant by independent positions? (Pg No. 42)
12. Define Non-degenerate basic feasible solution? (Pg No. 43)
13. Define Degenerate basic feasible solution? (Pg No. 43)
14. What are the advantages of Least Cost(LC) method over North West corner rule?
15. What is degeneracy in transportation problem? (Pg No. 48)
16. How to resolve degeneracy in transportation problem? (Pg No. 48)
17. What is meant by Unbalanced Transportation Problem? (Pg No. 50)
18. Define Assignment Problem? (Pg No. 52)
19. What are the differences between Transportation problem and Assignment problem?
(Pg No. 52)
Unit 3:
1. Define Integer Programming? (Pg No. 60)
2. Define pure integer programming? (Pg No. 60)
3. Define mixed integer programming? (Pg No. 60)
4. Define Zero-one programming or standard discrete programming problem? (Pg No.
60)
5. What are the applications of Zero-one integer programming? (Refer J.K. Sharma)
6. How to write the general integer programming problem? (Pg No. 60)
7. What is meant by Cutting method? (Pg No. 62)
8. What is meant by Search method? (Pg No. 62)
9. How to find the fractional cut constraint? (Pg No. 63)
10. Define Bounding? (Pg No. 66)
11. Write the disadvantage of Branch and Bound method? (Pg No. 66)
12. When a problem is said to be fathomed? (Pg No. 66)
13. Write the Needs of Dynamic Programming? (Pg No. 67)
14. Write the drawbacks of dynamic programming? (Pg No. 68)
15. Write Bellman’s Principle of Optimality? (Pg No. 68)
16. What are the characteristics of dynamic programming problems? (Pg No. 68)
17. Define State Variables? (Pg No. 68)
18. What is meant by Markovian Property? (Pg No. 68)
19. What are the applications of Dynamic programming? (Pg No. 69)
20. When will the function y=f(x) will attain its maximum? (Pg No. 70)
21. When will the function y=f(x) will attain its minimum? (Pg No. 70)

Unit 4:
1. Define event? (Pg No. 73)
2. Define initial event? (Pg No. 73)
3. How to number an event? (Pg No. 74)
4. Define Looping? (Pg No. 74)
5. Define Dangling? (Pg No. 75)
6. Mention the different types of Floats? (Pg No. 82)
7. Define Total float, free float, independent float, interference float? (Pg No. 82)
8. Write the basic differences between PERT and CPM? (Pg No. 83)
9. What is meant by Crash point? (Pg No. 85)
10. What is meant by Normal point? (Pg No. 85)
 11. Write the equation for Cost slop? (Pg No. 86)
12. Define Two-Person Zero-Sum Game? (Pg No. 90)
13. Define Payoff Matrix? (Pg No. 90)
14. What are the assumptions of the Game? (Pg No. 92)
15. What are the different methods to solve mixed strategy game? (Pg No. 95)

Unit 5:
1. Define Inventory? (Pg No. 106)
2. How the inventory may be kept? (Pg No. 106)
3. What are the types of inventory? (Pg No. 106)
4. Write the reasons for inventory? (Pg No. 106)
5. Define holding cost(C1)? (Pg No. 107)
6. Define Shortage Cost(C2)? (Pg No. 107)
7. Define Set-up Cost(C3)? (Pg No. 107)
8. State controlled Variable? (Pg No. 108)
9. State Uncontrolled Variable? (Pg No. 108)
10. Define Lead Time? (Pg No. 108)
11. Define Reorder Level? (Pg No. 108)
12. Define Economic Order Quantity(EOQ)? (Pg No. 108)
13. Define Price Breaks? (Pg No. 116)
14. Define Queuing System? (Pg No. 122)
15. Write Kendal’s Notation for representing Queuing Models? (Pg No. 122)