2. Once the initial basic feasible solution has been computed , what is the next step in the
problem
Correct : C. Optimality test
3. One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ?
Correct : A. VAM
4. What do we apply in order to determine the optimum solution ?
Correct : C. MODI Method
5. In a TP , if the number of non‐negative independent allocation is ‐‐‐‐‐‐‐‐‐‐‐‐ than m+n‐1.
Correct : C. Less
6. A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Demand
7. If the total supply is less than the total demand, a dummy source (row) is included in the cost
matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Zero Cost
8. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
Correct : C. MODI Method
9. For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
Correct : C. Profit
10. Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Decision – Making
11. The term Operations Research was coined in the year ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. 1940
12. This innovative science of Operations Research was discovered during ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. World War II
13. Operations Research was known as an ability to win a war without really going in to a ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : D. Both A and B
14. Who defined Operations Research as an aid for the executive in marketing his decisions by
providing him with the quantitative information based on the scientific method of analysis
Correct : A. C. Kitte
15. Operations Research has the characteristics the it is done by a team of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Scientists
16. Operations Research emphasizes on the overall approach to the system. This charecteristics of
Operations Research is often referred as
Correct : D. none
17. Operations Research uses models built by quantitative measurement of the variables concerning a given problem and also derives a solution from the model using ‐‐‐‐‐‐‐‐‐‐‐‐‐ of the diversified solution techniques
Correct : B. One or more
18. Operations Research uses models to help the management to determine its ‐‐‐‐‐‐‐‐‐‐‐
scientifically
Correct : C. Both A and B
19. Operations Research is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : D. Both A and B
20. Key concept under which technique are network of events and activities , resource
allocation, time and cost considerations, network paths and critical paths ?
Correct : B. Network Analysis
21. What is concerned with the prediction of replacement costs and determination of the
most economic replacement policy ?
Correct : B. Theory of replacement
22. Allocation problems can be solved by
Correct : C. Both A and B
23. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models are obtained by enlarging or reducing the size of the item
Correct : A. Iconic Models
24. The operations Research technique, specially used to determine the optimum strategy is
Correct : B. Simulation
25. It is not easy to make any modification or improvement in
Correct : C. Symbolic Models
26. Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Symbolic Models
27. Probabilistic models are also known as
Correct : B. Stochastic Models
28. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during
a particular period
Correct : A. Static Models
29. The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Variables
30. Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Bipartite graph
31. All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Constraints
32. If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Infeasible
33. The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Basic Variables
34. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Vector
35. Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Dual
36. As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Profit
37. Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Primal
38. ‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems.
Correct : A. Assignment problem
39. The quantitative approach to decision analysis is a
Correct : C. Scientific approach
40. Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Both A and B
41. This method of formal calculations often termed as Linear Programming was developed later in
which year?
Correct : A. 1947
42. The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Straight lines
43. The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Systematically
44. LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : D. All of the above
45. Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by
the graphical method.
Correct : D. Two decisions
46. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐
Correct : C. Feasible solution
47. Any feasible solution which optimizes (minimizes or maximizes) the objective function of
the LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Optimal solution
48. 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
49. 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
50. In simplex algorithm , which method is used to deal with the situation where an
infeasible starting basic solution is given?
Correct : C. M‐ method
51. How many methods are there to solve LPP?
Correct : B. Two
52. 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
53. A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Solution
54. A basic solution which also satisfies the condition in which all basic variables are non ‐
negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Basic feasible solution
55. 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
56. Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : A. Business problems
57. 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
58. 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
59. MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Both A and B
60. To make an unbalanced assignment problem balanced, what are added with all entries
as zeroes?
Correct : C. Both A and B
61. Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum
(rim requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Feasible solution
62. A feasible solution is called a basic feasible solution if the number of non‐negative allocations
is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. m+n‐1
63. Any feasible solution to a transportation problem containing m origins and n destinations
is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Non‐degenerate
64. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐
from O origins and D destinations
Correct : A. Goods
65. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : B. Balanced problem
66. 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
67. In which phase is optimization done and how does that phase also checks for
optimality conditions?
Correct : C. Phase II
68. Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
Correct : C. Total cost
69. 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
70. The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Both A and B
71. VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : D. Vogel’s Approximation Method
72. If the total supply is less than the total demand, a dummy source (row) is included in the
cost matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐
Correct : C. Zero Cost
73. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
Correct : C. MODI Method
74. For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐