1. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are the representation of reality
Correct : A. Models
2. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models
Correct : C. Symbolic Models
3. It is not easy to make any modification or improvement in
Correct : C. Symbolic Models
4. In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties
Correct : A. Iconic Models
5. Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Symbolic Models
6. Probabilistic models are also known as
Correct : B. Stochastic Models
7. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during a
particular period
Correct : A. Static Models
8. A ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models considers time as one of the important variable
Correct : B. Dynamic Models
9. Replacement Model is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ model
Correct : B. Dynamic Models
10. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme inter
dependent activities in view of available resources
Correct : B. Linear Programming
11. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are expressed is n the form of inequities or equations
Correct : A. Constraints
12. The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Variables
13. Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Bipartite graph
14. All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Constraints
15. The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers
Correct : B. Whole Number
16. Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable
Correct : C. Two
17. If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Infeasible
18. The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Basic Variables
19. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Vector
20. A minimization problem can be converted into a maximization problem by changing the sign of
coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Objective Functions
21. If in a LPP , the solution of a variable can be made infinity large without violating the constraints,
the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Unbounded
22. In maximization cases , ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients in
the objective function
Correct : A. +m
23. In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’
Correct : C. Artificial Variable
24. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected
Correct : C. Decision variable
25. A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero
Correct : A. Degenerate
26. In LPP, degeneracy occurs in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ stages
Correct : B. Two
27. Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Dual
28. As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Profit
29. If there are more than one optimum solution for the decision variable the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Alternative
30. Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Primal
31. Operations Research approach is
Correct : C. Initiative
32. For analyzing the problem , decision – makers should normally study
Correct : A. Its qualitative aspects
33. Decision variables are
Correct : D. None of the above
34. The issue of decision models
Correct : D. None of the above
35. ‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems.
Correct : A. Assignment problem
36. An optimization model
Correct : D. All of the above
37. The quantitative approach to decision analysis is a
Correct : C. Scientific approach
38. Operations Research approach is typically based on the use of
Correct : B. Mathematical model
39. In a manufacturing process, who takes the decisions as to what quantities and which process or
processes are to be used so that the cost is minimum and profit is maximum?
Correct : D. Production manager
40. Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Both A and B
41. The term linearity implies ‐‐‐‐‐‐‐‐‐‐‐ among the relevant variables:
Correct : D. Both A and B
42. Process refers to the combination of ‐‐‐‐‐‐‐‐‐‐‐‐ inputs to produce a particular output.
Correct : A. one or more
43. What has always been very important in the business and industrial world, particularly with
regard to problems concerning productions of commodities?
Correct : C. Decision – making
44. What are the main questions before a production manager?
Correct : D. All of the above
45. Who pointed out that the businessman always studies his production function and his input
prices and substitutes one input for another till his costs become the minimum possible?
Correct : C. Alfred Marshall
46. Who invented a method of formal calculations often termed as ?
Correct : D. Alfred Marshall
47. Who developed Linear Programming for the purpose of scheduling the complicated
procurement activities of the United States Air Force?
Correct : A. George B. Dantzig
48. This method of formal calculations often termed as Linear Programming was developed later in
which year?
Correct : A. 1947
49. What is being considered as one of the most versatile management tools?
Correct : B. Linear Programming
50. LP is a major innovation since ‐‐‐‐‐‐‐‐‐‐‐‐ in the field of business decision – making, particularly
under conditions of certainty.
Correct : C. World War II
51. The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Straight lines
52. The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Systematically
53. Who originally called it ‘ Programming of interdependent activities in a linear structure’ but later
shortened it to ‘ Linear Programming’ ?
Correct : A. Dantzig
54. LP can be applied in farm management problems is relates to the allocation of resources such as
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ , in such a way that is maximizes net revenue
Correct : D. All of the above
55. LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : D. All of the above
56. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the prior knowledge of all the coefficients in the objective
function, the coefficients of the constraints and the resource values.
Correct : B. Certainty
57. Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the
graphical method.
Correct : D. Two decisions
58. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐
Correct : C. Feasible solution
59. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the
LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Optimal solution
60. A non – degenerate basic feasible solution is the basic feasible solution which has exactly m
positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Zero
61. What is also defined as the non‐negative variables which are added in the LHS of the constraint
to convert the inequality ‘< ‘ into an equation?
Correct : A. Slack variables
62. Which method is an iterative procedure for solving LPP in a finite number of steps ?
Correct : D. Simplex method
63. In simplex algorithm , which method is used to deal with the situation where an infeasible
starting basic solution is given?
Correct : C. M‐ method
64. How many methods are there to solve LPP?
Correct : B. Two
65. ‐‐‐‐‐‐‐‐‐‐‐‐ is another method to solve a given LPP involving some artificial variable ?
Correct : C. Two‐phase simplex method
66. Which variables are fictitious and cannot have any physical meaning ?
Correct : C. Artificial variable
67. An objective function which states the determinants of the quantity to be either maximized or
minimized is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Criterion function
68. An assumption that implies that finite numbers of choices are available to a decision – maker
and the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Finite choices
69. A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Solution
70. A basic solution which also satisfies the condition in which all basic variables are non ‐negative
is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Basic feasible solution
71. All the constraints are expressed as equations and the right hand side of each constraint and all
variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Canonical form
72. An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function
Correct : B. Profit
73. LPP is exactly used in solving what kind of resource allocation problems?
Correct : D. All of the above
74. Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Business problems
75. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ refers to the combination of one or more inputs to produce a particular output.
Correct : C. Process
76. An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible solutions.
Correct : B. Best
77. Please state which statement is true.
(i) All linear programming problems may not have unique solutions (ii) The artificial variable technique is not a device that does not get the starting basic feasible solution.
Correct : C. (i) only
78. Please state which statement is incorrect.
(i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions.
Correct : B. (i) only
79. ‐‐‐‐‐‐‐‐‐‐‐‐ which is a subclass of a linear programming problem (LPP)
Correct : B. Transportation problem
80. The solution of any transportation problem is obtained in how many stages?
Correct : D. Two
81. An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution
Correct : C. Second
82. MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Both A and B
83. For solving an assignment problem, which method is used?
Correct : A. Hungarian
84. To make an unbalanced assignment problem balanced, what are added with all entries as
zeroes?
Correct : C. Both A and B
85. Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim
requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Feasible solution
86. A feasible solution is called a basic feasible solution if the number of non‐negative allocations is
equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. m+n‐1
87. Any feasible solution to a transportation problem containing m origins and n destinations is
said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Non‐degenerate
88. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are
occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Closed path
89. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from
O origins and D destinations
Correct : A. Goods
90. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Balanced problem
91. Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow
Correct : D. zero
92. According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. m+n‐1
93. Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐
‐‐‐‐‐‐ column incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less than the demand
Correct : D. Unshipped supply, Shortage
94. In which phase is optimization done and how does that phase also checks for optimality
conditions?
Correct : C. Phase II
95. Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells?
Correct : C. Reduced costs
96. A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign.
Correct : A. Cycle
97. After determining every basic cell with in this cycle, adjustment is obtained as minimum value
in basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Both A and B
98. Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
Correct : C. Total cost
99. State which of the two statements is correct
(i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
Correct : C. One only
100. The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐