Practice Set: Operation Research (BMA342)
1. The maximization or minimization of a quantity is the
a. goal of management science.
b. decision for decision analysis.
c. constraint of operations research.
d. objective of linear programming.
2. Decision variables
a. tell how much or how many of something to produce, invest, purchase, hire, etc.
b. represent the values of the constraints.
c. measure the objective function.
d. must exist for each constraint.
3. While solving a LP problem, infeasibility may be removed by
a. Adding another variable
b. Adding another constraint
c. Removing a constraint
d. Removing a variable
4. Slack
a. is the difference between the left and right sides of a constraint.
b. is the amount by which the left side of a ≤ constraint is smaller than the right side.
c. is the amount by which the left side of a ≥ constraint is larger than the right side.
d. exists for each variable in a linear programming problem.
5. Infeasibility means that the number of solutions to the linear programming models that satisfies all
constraints is
a. at least one
b. 0
c. an infinite number
d. at most one
6. A constraint that does not affect the feasible region is a
a. non-negative constraint.
b. redundant constraint.
c. standard constraint
d. slack constraint
7. A physical model is an example of
a. An iconic model
b. An analogue model
c. A verbal model
d. A mathematical model
8. The term Operation Research was coined in the year
a. 1950 b. 1940 c. 1978 d. 1960
9. This innovative science of operation research was discovered during
a. Civil War b. World War-I c. World war-II d. Industrial revolution
10. In which models, everything is defined and the results are certain
a. Deterministic models b. Probabilistic models
c. Both a and b d. None of above
11. In which models, there is risk and uncertainty
a. Deterministic models b. Probabilistic models
c. Both a and b d. None of above
12. Operation research attempts to find best and
a. Optimal solution b. Perfect solution c. Degenerate solution d. None of these
13. Which of the following are expressed in terms of inequalities and equations?
a. objective function b. constraints c. both a and b c. none of these
14. If there is more than one optimal solution for the decision variables, the solution is called
a. Infeasible b. Unbounded c. Alternative d. Unique solution
15. The dual of dual is
a. Primal b. Dual c. Alternative d. None of these
16. Decision variables are
a. Controllable b. Uncontrollable c. Parameters d. None of these
17. Operation research approach is typically based on the use of
a. Physical model b. Mathematical model c. Iconic model d. Descriptive models
18. A model is
a. An essence of reality b. An approximation d. An idealization d. All of these
19. The initial solution of a transportation problem can be obtained by applying any known
method, however, the only condition is that
a. The solution be optimal b. The rim conditions are satisfied
c. The solution not be degenerate d. All of these
20. The dummy source or destination in a transportation problem is added to
a. Satisfy rim conditions b. Prevent solution from becoming degenerate
c. Ensure that total cost does not exceed the limit d. None of above
21. The occurrence of degeneracy while solving a transportation problem means that
a. Total supply equals total demand b. The solution so obtained is not feasible
c. Few allocations becomes negative d. None of above
22. One disadvantage of using North-West Corner rule to find initial solution to the
transportation problem is that
a. It is complicated to use b. It does not take into account cost of transportation
c. It leads to a degenerate initial solution d. all of these
23. The solution to a transportation problem with ‘m’ rows (supplies) and ‘n’ columns
(destinations) is feasible if number of positive allocations are
a. m+n b. m*n c. m+n-1 d. m+n+1
24. An assignment problem is considered as a particular case of transportation problem because
a. The number of rows equals columns b. All Xij=0 or 1
c. All rim conditions are 1 d. All of these
25. The method is used to solve an assignment problem is said to be
a. Reduced matrix method b. MODI method
c. Hungerian method d. None of these
26. The purpose of dummy row or dummy column in an assignment problem is to
a. Obtain balance b/w total activities & resources.
b. Prevent a solution from becoming degenerate.
c. Provide a means of representing a dummy problem.
d. None of these
27. If there were n workers and n jobs there would be
a. n! solutions b. (n-1)! solutions c. (n!)n solutions d. n solutions
28. An assignments problem can be solved by
a. Simplex method b. Transportation method c. Both a and b c. None of these
29. The assignment problem
a. requires that only one activity is assigned to each resource.
b. is a special case of transportation problem
c. can be used to maximize the resources
d. all of these
30. To proceed with the MODI algorithm for solving an assignment problem, the number of
dummy allocations need to be added are
a. n b. 2n c. n-1 d. 2n-1
31. The objective function and constraints are linear relationship b/w
a. Variables b. Constraints c. Functions d. All of these
32. Graphical method can be applied to solve a LPP when there are only
a. one variable b. two variables c. more than one variables d. three variables
33. If the feasible region of LPP is empty, then solution is
a. Infeasible b. Unbounded c. Alternatives d. Unique
34. The variables whose corresponding coefficient matrix is invertible are called
a. Unit variables b. Basic variables c. Non basic variables d. None of these
35. A minimization problem can be converted into a maximization problem by changing the sign
of
a. Constraints b. Objective function c. both a and b d. none of these
36. In maximization cases, which of the followings are assigned to the artificial variables as
their coefficients in the objective function
a. +m b. –m c. 0 d. None of these
37. In simplex method, we add the following variables for = type constrains?
a. Slack variables b. Surplus variables c. Artificial variables d. None of these
38. In a simplex method, if there is tie up b/w a decision variable and a slack (or surplus)
variable, the which one should be selected
a. slack variables b. surplus variable d. decision variable d. none of these
39. If one basic variable is zero then the basic feasible solution of a LPP is said to be
a. Degenerate b. Non-degenerate c. Infeasible d. Unbounded
40. In a LPP, degeneracy occurs in
a. one stage b. two stages c. three stages d. four stages
41. Every LPP associated with another LPP is called
a. Primal b. Dual c. Non Linear Programming d. Dynamic Programing
42. Linear Programing problem is
a. Constrained optimization techniques
b. Technique for economically avocations of limited resources
c. Mathematical techniques
d. All of these
43. A constraint in an LP model restricts
a. value of objective function b. value of decision variables
c. use of available resources d. All of these
44. The distinguish features of an LP model is
a. relationship among all the variables is linear
b. it has single objective function and constraints
c. value of decision variables is non negatives
d. All of these
45. Constraints in a LP model represents
a. Limitations b. Requirements c. Balancing limitations and requirements d. all of these
46. The best use of linear programming problem is to find the an optimal use of
a. money b. Man power c. Machine d. All of these
47. Which of the following is an assumption of an LP model
a. Divisibility b. Proportionality c. Additivity d. All of these
48. An iso-profit line represents
a. An infinite number of solutions all of which yield the same profit
b. An infinite number of solutions all of which yield the same cost
c. An infinite number of optimal solutions
d. A boundary of feasible region
49. While solving a LP model graphically the area bounded by the constraints is called
a. feasible region b. Infeasible region c. Unbounded region d. None of these
50. The solution space (region) of an LP model is unbounded due to
a. An incorrect formulation of the LP model
b. objective function is unbounded
c. Neither a nor b
d. Both a and b
51. Which of the following is not the objective function of LP Problem.
a. Max = 2 + 5 b. Min = +
(2 + 7 (5 + 9)
c. Max = 5 d. Min z= 7
52. In which of the following constraints of LP Problem, slack is required.
a. 2 + 5 ≤ 2 b. 2 + 3 ≥ 7
c. 4 + 7 = 5 d. 8 + 14 = 10
53. In which of the following constraints of LP Problem, surplus is required.
a. 2 + 5 ≤ 2 b. 2 + 3 ≥ 7
c. 4 + 7 = 5 d. 8 + 14 = 10
54. For which of the following primal constraints, corresponding dual variable is unrestricted.
a. 2 + 5 ≤ 2 b. 2 + 3 ≥ 7
c. 4 + 7 = 5 d. 3 + 5 ≤ 9
55. Which of the following relation is valid for LP problem
a. Max (-z) = -Min z b. Max z= -Min z
c. Max z = Min (-z) d. All are not valid
56. If , , and are the basic variables of a LP problem, then which of the following
can not be the degenerate basic feasible solution.
a. = 1, = 2, = 3 and = 4 b. = 1, = 0, = 3 and = 4
c. = 1, = 2, = 3 and = 0 d. = 0, = 2, = 3 and = 4
57. If the objective function of Phase-I problem has non zero optimal value, then the solution of
LP primal is
a. Unbounded b. Infeasible c. Alternatively d. Unique
58. For any system of linear equations with 4 independent rows and 5 variables, the maximum
possible basic solutions are
a. 5 b. 120 c. 24 d. 60
59. Let the LP (Primal) has the following form
Max z=4 + 3 subjected to + ≤ 8, 2 + ≤ 10, and , ≥ 0, then
(i) The basic feasible solution after second iteration of simplex method is
a. = 5, =1 b. = 3, = 1 c. = 5, =0 d. = 0, =5
(ii) The optimal value of z is
a. 20 b. 25 c. 26 d. 24
60. Let the LP (Primal) has the following form
Max z= 4 + 3 subjected to + ≤ 8, 5 + 6 ≥ 60, and , ≥ 0,then
(i) The objective function of Phase-I problem is
a. Max = 4 b. Max = − c. Max = −4 d. Max = .
(ii) The solution of above problem by Phase-II method is
a. 26 b. does not exist c. Alternatively d. Unbounded
61. Let the LP (Primal) has the following form
Max z= 2 + subjected to + ≥ 1, − + ≥ 1, and , ≥ 0, then
(i) The feasible region of above problem have only
a. one point b. two points c. infinitely many points d. no common point
(ii) Optimal value of z for above LP (Primal) is
a. Infeasible b. 1 c. Unbounded d. 2
62. Let ⊆ ! , The set S is called a convex set if for 0 ≤ " ≤ 1, , # ∈ , then
a. " + (1 + " )# ∈ b. " + (1 + " )# ∉ c. " + (1 − " )# ∈ d. " + (1 − " )# ∉
63. For any Maximization LP (Primal), If some & − "& < 0 and for that j some (& > 0, then
there exists a new basic feasible solution +* such that
a. ( * ) ≤ (+* ) b. ( * ) = (+* ) d. ( * ) ≥ (+* ) d. All are not possible
64. Let the LP (Primal) has the following form
Max z= 2 + subjected to + ≥ 1, − + = 5, and , ≥ 0, then
(i) Then the objective function of dual of above primal LPP is
a. Max = 2, + , b. Max = , + 5,
c. Min = , + 5, d. Min = 2, + ,
(ii) The corresponding dual variables are
a. , ≤ 0, , is unrestricted in sign b. , ≤ 0, , is unrestricted in sign
c. , ≤ 0, , ≥ 0 d. , ≤ 0, , ≥ 0
65. Let x be feasible for the primal and w be feasible for the dual. Then
a. " - ≤ .- , b. " - ≥ .- ,
c. both a and b are correct d. both a and b are not correct
66. Let x be optimal for the primal and w be optimal for the dual. Then
a. " - ≤ .- , b. " - ≥ .- ,
c. " - = .- , d. all are not correct
67. Let the LP (Primal) has the following form
Max z= 4 + 3 subjected to + ≤ 8, 5 + 6 ≥ 60, and , ≥ 0,then
which method is not applicable for the solution of above problem
a. Simplex method b. Two Phase method c. Big-M method d. All are correct
68. If ̅ and ,0 are the optimal solution of corresponding primal and dual pair, then
-(
0 1̅ − b) = 0
a. , b. ̅ - (" − 1̅- ,
0) = 0
c. both a and b are correct d. both a and b are not correct
Hint: Complementary slackness theorem
69. If one primal constraint has strict inequality then corresponding dual variable will be
a. 0 b. non zero c. unrestricted in sign d. positive
Hint: Deductions from complementary slackness theorem
70. The Transportation Problem has
Supply units: = 10, = 15, = 20, and Requirement units: 3 = 13, 3 = 18, 3 = 14,
and entries for cost matrix are " = 2, " = 1, " = 4, " = 6, " = 3, " = 2,
" = 4, " = 2, " = 3, then
(i) The initial basic feasible solution of above TP by North-West Corner rule is
a. = 10, = 3, = 12, = 6, = 14, and other (& = 0.
b. = 9 , = 4, = 11, = 6, = 14, and other (& = 0.
c. = 10, = 3, = 12, = 6, = 14, and other (& = 0.
d. all (& = 0.
(ii) Transportation cost after initial iteration using North-west corner rule is
a. 120 b. 128 c. 102 d. 67
71. In the optimal iteration of MODI algorithm to solve a Transportation problem, which is true
for non basic cells:
a. (# ( + 5& − "(& ) = 0 b. (# ( + 5& − "(& ) ≤ 0
c. (# ( + 5& − "(& ) ≥ 0 d. (# ( + 5& − "(& ) is unrestricted in sign
72. In an optimal table of transportation problem, the values of primal variables for non basic
cells are
a. 0 b. non zero c. non-negatives d. non-positives
73. 72. In the optimal table of transportation problem, the values of primal variables for basic
cells are
a. 0 b. non- zero c. Non-negatives d. non-positives
74. In an Assignment problem, the no. of jobs and persons both are n. During the Hungerian
method, the maximum no. of independent zeros are
a. n b. more than n c. less than n d. less than or equal to n
75. In an Assignment problems, 3 persons are required to assign for 3 jobs. The cost entries are
given below: " = 27, " = 20, " = 30, " = 16, " = 18, " = 17, " = 12, " =
14, " = 16. Then
(i) The minimum optimal assignments are
a. 6 → 8 , 6 → 8 , 6 → 8 b. 6 → 8 , 6 → 8 , 6 → 8
c. 6 → 8 , 6 → 8 , 6 → 8 d. 6 → 8 , 6 → 8 , 6 → 8
(ii) The minimum optimal assignment cost is
a. 36 b. 49 c. 60 d. 59
76. The primal variables of an Assignments problem are
a. 0 b. 1 c. either 0 or 1 d. 0 and 1 both
77. An assignment problem with 4 jobs and 4 persons which have following cost matrix:
" = 8, " = 26, " = 17, " = 11, " = 12, " = 28, " = 4, " = 26, " =
18, " = 19, " = 18, " = 5, " = 18, " = 16, " = 24, " = 10. then the minimum
assignment cost is
a. 40 b. 33 c. 49 d. 39
78. In Q. No. 77, what are the optimal assignments if it is given that 4th Job cannot be assigned
to the first person.
a. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8 b. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8
c. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8 d. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8
79. In Q. No. 77, what are the optimal assignments if it is given that 2nd person is sure to do the
4th job.
a. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8 b. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8
c. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8 d. 6 → 8 , 6 → 8 , 6 → 8 , 6 → 8
80. In Q. No. 79, what is the minimum optimal assignment cost is
a. 33 b. 68 c. 49 d. 58
Next Questions……..coming soon!!!
