2. Operation research approach is typically based on the use of _______.
Correct : B. mathematical model.
3. Mathematical model of linear programming problem is important because______.
Correct : A. it helps in converting the verbal description and numerical data into mathematical expression
4. In Program Evaluation Review Technique for an activity, the optimistic time 2, the pessimistic time is 12 and most-likely time is 4. What is the expected time?
Correct : C. 5
5. Graphical method of linear programming is useful when the number of decision variable are ________.
Correct : A. 2
6. In a given system of m simultaneous linear equations in n unknowns (m<n) there will be ________.
Correct : B. m basic variables
7. A feasible solution to a linear programming problem _____.
Correct : A. must satisfy all the constraints of the problem simultaneously
8. An Iso-profit line represents______.
Correct : B. an infinite number of solutions all of which yield the same profit
9. While solving a linear programming problem in feasibility may be removed by _________.
Correct : C. removing a constraint
10. In the optimal simplex table, Zj-Cj=0 value indicates _____________.
Correct : A. alternative solution
11. If any value in XB column of final simplex table is negative, then the solution is___.
Correct : A. infeasible
12. If all aij values in the entering variable column of the simplex table are negative, then _____.
Correct : D. solution is unbounded
13. If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is___________.
Correct : D. infeasible
14. For any primal problem and its dual______________.
Correct : B. primal will have an optimal solution iff dual does too
15. The right hand side constant of a constraint in a primal problem appears in the corresponding dual as___________.
Correct : A. a coefficient in the objective function
16. Principle of complementary slackness states that____________.
Correct : A. primal slack*dual main=0.
17. If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
Correct : A. finite solution
18. The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that__________.
Correct : B. the rim conditions are satisfied
19. The dummy source or destination in a transportation problem is added to_______.
Correct : A. satisfy rim conditions
20. One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that_______.
Correct : B. it does not take into account cost of transportation
21. The calculations of opportunity cost in the MODI method is analogous to a_____.
Correct : A. Zj-Cj value for non-basic variable column in the simplex method.
22. An unoccupied cell in the transportation method is analogous to a________.
Correct : C. variable not in the B-column in the simplex table.
23. During iteration while moving from one solution to the next, degeneracy may occur when______________.
Correct : C. two or more occupied cells on the closed path with minus sigh are tied for lowest circled value.
24. Which of the following methods is used to verify the optimality of the current solution of the transportation problem_________.
Correct : A. Modified Distribution Method
25. An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______.
Correct : A. rows or coloumns
26. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.
Correct : A. minimize total cost of assignment.
27. Maximization assignment problem is transformed into a minimization problem by_________.
Correct : C. subtracting each entry in the table from the maximum value in that table
28. For a salesman who has to visit n cities, following are the ways of his tour plan___.
Correct : C. (n-a)!
29. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are___________.
Correct : B. n-1
30. Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
Correct : A. 2n-1
31. A feasible solution to an LP problem______.
Correct : A. must satisfy all of the problems constraints simultaneously
32. An optimal solution to a maximization problem is reached if all
Correct : A. Zj-Cj>=0
33. Cells in the transportation table having positive allocation will be called___.
Correct : B. occupied
34. The solution must satisfy all the supply and demand constraints is called_____.
Correct : D. rim conditions
35. Priority queue discipline may be classified as__________.
Correct : C. unlimited
36. The calling population is assumed to be infinite when______.
Correct : A. arrivals are independent of each other
37. Service mechanism in a queuing system is characterized by_____.
Correct : B. servers behavior
38. The problem of replacement is felt when job performing units fail_____.
Correct : A. suddenly and gradually
39. Replace an item when________.
Correct : A. average annual cost for n years becomes equal to current running cost
40. The average annual cost will be minimized by replacing a machine when_____.
Correct : A. average cost to date is equal to the current maintenance cost
41. The group replacement policy in suitable for identical low cost items which are likely to_________.
Correct : C. fail over a period of time
42. The objective of network analysis is to___________.
Correct : A. minimize total project duration
43. A activity in a network diagram is said to be __________ if the delay in its start will further delay the project completion time.
Correct : C. critical
44. If an activity has zero slack, it implies that_________.
Correct : C. it lies on the critical path
45. In program evaluation review technique network each activity time assume a beta distribution because_________.
Correct : A. it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
46. Float analysis in useful for________.
Correct : A. projects behind the schedule only
47. The activity which can be delayed without affecting the execution of the immediate succeeding activity is determined by_________.
Correct : B. free float
48. In time cost trade off function analysis_________.
Correct : A. cost decreases linearly as time increases
49. A degenerate solution is one that ________.
Correct : B. gives zero value to one or more of the basic variables
50. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.
Correct : C. unbounded
51. When we solve a system of simultaneous linear equations by using two-phase method, the values of decision variables will be _______.
Correct : D. positive and/or negative
52. The transportation problem deals with the transportation of ________.
Correct : A. a single product from a source to several destinations
53. The transportation problem is balanced, if _______.
Correct : C. total demand equals total supply irrespective of the number of sources and destinations
54. The calling population is considered to be infinite when ________.
Correct : B. capacity of the system is infinite
55. The assignment problem is a special case of transportation problem in which ______.
Correct : D. number of origins equals the number of destinations
56. Identify the correct statement
Correct : C. an unbalanced assignment is one where the number of rows is more than, or less than the number of columns
57. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____.
Correct : A. at the most n
58. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
Correct : A. 5
59. In marking assignments, which of the following should be preferred?
Correct : C. Only row/column having single zero
60. The average arrival rate in a single server queuing system is 10 customers per hour and average service rate is 15 customers per hour. The average time that a
customer must wait before it is taken up for service shall be _______minutes.
Correct : B. 8
61. Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with mean rate of 20 per hour, while the mean service
time is 2 minutes. Which of the following is not true for this system?
Correct : A. E(n) = 2 customers
62. A petrol pump has two pumps; Vehicles arrive at the petrol pump according to poison input process at average of 12 per hour. The service time follows exponential
distribution with a mean of 4 minutes. The pumps are expected to be idle for _____.
Correct : B. 43%
63. The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that____.
Correct : B. the rim conditions are satisfied
64. An assignment problem can be solved by______.
Correct : D. Simplex and Transportation Method
65. A game is said to be fair if___
Correct : A. both upper and lower values of the game are same and zero
66. A mixed strategy game can be solved by ____.
Correct : D. Graphical Method
67. When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known as_____.
Correct : B. zero-sum game
68. The critical path satisfy the condition that _____.
Correct : A. Ei=Li and Ej=Lj
69. In Program Evaluation Review Technique the maximum time that is required to perform the activity under extremely bad conditions is known as_____.
Correct : D. pessimistic time
70. ._____is a mathematical technique used to solve the problem of allocating limited resource among the competing activities
Correct : A. Linear Programming problem
71. The Hungarian method used for finding the solution of the assignment problem is also called ___________.
Correct : B. Modi Method
72. Traveling salesman problem will have a total of _____different sequences.
Correct : D. n
73. In the production lot size model, increasing the rate of production _______ .
Correct : A. increase the optimal number of orders to place each year
74. The __________ time for an activity can be reduced by using increased resources.
Correct : A. normal
75. Graphical method of linear programming is useful when the number of decision variable are _______
Correct : A. 2
76. The activity cost corresponding to the crash time is called the _____.
Correct : D. crash cost
77. The irreducible minimum duration of the project is called______.
Correct : B. crashed duration
78. In the network, only one activity may connect any _______nodes
Correct : B. 2
79. If the constraints of an Linear Programming Problem has an in equation of greater than or equal to type, the variable to be added to are ___________
Correct : B. surplus
80. If the constraint of an Linear Programming Problem has an in equation of less than or equal to type, the variables to be added are__________
Correct : A. slack
81. A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
Correct : B. optimum solution
82. A set of feasible solution to a Linear Programming Problem is ___________
Correct : A. convex
83. The cost of a slack variable is _________.
Correct : A. zero
84. The cost of a surplus variable is _________.
Correct : A. zero
85. If all the constraints of the primal problem in equations are of type less than or equal to then the constraints in the dual problem is ___________.
Correct : B. greater than or equal to
86. In an Linear Programming Problem functions to be maximized or minimized are called ___________.
Correct : B. objective function
87. Linear Programming Problem that can be solved by graphical method has______.
Correct : A. linear constraints
88. Charnes method of penalty is called __________
Correct : C. Big-M Method
89. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
Correct : A. mn
90. Graphical method is also known as ___________.
Correct : D. Search Approach Method
91. The area bounded by all the given constraints is called _____________.
Correct : A. feasible region
92. If one or more variable vanish then a basic solution to the system is called ____________.
Correct : C. degenerate solution
93. The non basic variables are called ___________.
Correct : A. shadow cost
94. If the given Linear Programming Problem is in its canonical form then primal-dual pair is ___________.
Correct : B. unsymmetric
95. If the given Linear Programming Problem is in its standard form then primal-dual pair is ____________.
Correct : B. unsymmetric
96. The dual of the dual is ____________.
Correct : D. primal
97. Key element is also known as ___________.
Correct : D. pivot
98. ____________ method is an alternative method of solving a Linear Programming Problem involving artificial variables
Correct : B. Big-M Method
99. The method used to solve Linear Programming Problem without use of the artificial variable is called __________.
Correct : C. Dual Simplex Method
100. All the basis for a transportation problem is ____________.