‫ بحوث العمليات‬: ‫مادة‬ ‫جمهورية مصر العربية‬

BS 202 Operations Research

‫ األولى & الثانية‬: ‫الفرقة‬ (7) ‫وزارة التعليم العالي‬
‫ الثاني‬: ‫الفصل الدراسي‬ Final Review Exercise sheet ‫مدينة الثقافة والعلوم‬
2023 / 2022 ‫عام‬ ‫المعهد العالي لعلوم الحاسب ونظم المعلومات‬

1. Graphical method, simplex method and transportation method are concerned with
a. Value analysis
b. Queuing theory
c. Linear programming
d. Break even analysis
2. Statement I: Transportation model aims at minimizing cost of material handling.
Statement II: Transportation model aims at profit maximization.
Choose the correct option from those below:
a. Statement I is correct, Statement II is incorrect.
b. Statement I is incorrect, Statement II is correct.
c. Both Statement I and Statement II are correct.
d. Both Statement I and Statement II are incorrect
3. Successful applications of the linear programming techniques may be found in
a. All of the preceding.
b. Chemical and oil.
c. Food processing.
d. The iron and steel industry.
4. Linear programming
a. converts a mathematical model into a physical system
b. is a technique based on mathematical theory for specifying the ways to use
limited resources or constraints of a system to obtain a particular objective
when these resources have
c. makes use of non-linear objective function
d. problems are expressed in the form of non-linear inequalities as constraints
5. In a transportation problem with 4 supply points and 5 demand points, how many
numbers of constraints are required in its formulation?
a. 20
b. 1
c. 0 8
d. 9
6. Consider the Linear Programming problem:

[1]
 Maximize: 7 X1 + 6 X2 + 4 X3
subject to:
X1 + X2 + X3 ≤ 5;
2 X1 + X2 + 3 X3 ≤ 10,
X1 , X2 , X3 ≥ 0 (Solve by algebraic method).
The number of basic solutions is:
a. 10 3
b. 7
c. 8
d. 5
7. If the ith constraint of a primal (maximization) is equality, then the dual
(minimization) variable ‘y1’ is:
a. 1. ≥ 0
b. 2. ≤ 0
c. 3. Unrestricted in sign
d. 4. None of the above
8. Vogel’s approximation method is connected with
a. Assignment problem
b. Inventory problem
c. Transportation problem
d. PERT
9. Least Cost approximation method is connected with
a. Assignment problem
b. Inventory problem
c. Transportation problem
d. PERT
10. North West approximation method is connected with
a. Assignment problem
b. Inventory problem
c. Transportation problem
d. PERT
11. Hungarian’s approximation method is connected with
a. Assignment problem
b. Inventory problem
c. Transportation problem
d. PERT
12. Dijkstra’s Algorithm is connected with
a. Spanning tree problem
b. Shortest-Path Problems

[2]
 c. Transportation problem
d. Maximum-Flow Problems
13. Ford-Fulkerson Method is connected with
a. Spanning tree problem
b. Shortest-Path Problems
c. Transportation problem
d. Maximum-Flow Problems
14. For the following LPP -
Max. Z = – 0.1 X1 + 0.5 X2
Subject to:
2 X1 + 5 X2 ≤ 80
X1 + X2 ≤ 20
X1, X2 ≥ 0
to get the optimum solution, the values of X1, X2 are -
a. (20, 0)
b. (20/3, 40/3)
c. (0, 16)
d. None of these
15. If there are m sources and n destinations in a transportation matrix, the total number
of basic variables in a basic feasible solution is
a. m + n
b. m + n + 1
c. m + n – 1
d. m
16. Consider the given problem:
5x + y ≤ 100 ... (1)
x + y ≤ 60 ... (2)
x ≥0 ... (3)
y≥0 ... (4)
If we solve the above linear equations by the graphical method of Linear
Programming, then the following point ____ will not form the boundary of the
feasible region.
a. (60, 0)
b. (20, 0)
c. (0, 60)
d. (10, 50)
17. In the Simplex method if in pivot column all the entries are negative or zero when

[3]
 choosing leaving variable then
a. Solution is Degenerate
b. Solution is infeasible
c. Alternative optima
d. Unbounded
18. In the Simplex method If all the replacement ratios, bi / ai (ai - key column or pivot
column coefficients are negative) then it is an ――.
a. Solution is Degenerate
b. Solution is infeasible
c. Alternative optima
d. Unbound Solution
19. In a Linear programming problem, the restrictions or limitations under which the
objective function is to be optimized are called
a. Constraints
b. Objective function
c. Decision variables
d. None of the above
20. In a Linear programming problem, a linear function of two or more variables which
has to be maximized or minimized under the given restrictions is called
a. Constraints
b. Objective function
c. Decision variables
d. None of the above
21. In a Linear programming problem, the variables used in the objective function are
called as
a. Constraints
b. Objective function
c. Decision variables
d. None of the above
22. In a Linear programming problem, these are the restrictions on the variables are
called as
a. Constraints
b. Objective function
c. Decision variables
d. None of the above
23. In a Linear programming problem, the final solution of the objective function must
satisfy these

[4]
 a. Constraints
b. Objective function
c. Decision variables
d. None of the above
24. In Simplex Method, this variable is introduced to eliminate less-than (<) constraints.
a. Non basic Variables
b. Slack Variable
c. Surplus Variable
d. Artificial Variable
25. In Simplex Method, this variable is introduced to eliminate greater-than (>) constraints.
a. Non basic Variables
b. Slack Variable
c. Surplus Variable
d. Artificial Variable
26. In Simplex Method, this variable is not in the basic solution and is having the value
zero.
a. Non basic Variables
b. Slack Variable
c. Surplus Variable
d. Artificial Variable
27. In Simplex Method, this variable is introduced in case of greater than or equal to type
constraint to not violate the non-negativity constraint.
a. Non basic Variables
b. Slack Variable
c. Surplus Variable
d. Artificial Variable
28. In Simplex Method, they can be defined as the variables which can take any value other
than zero.
a. Non basic Variables
b. Slack Variable
c. Basic Variables
d. Artificial Variable

For The following graph represents the constraints of a linear programming problem whose
objective function is to be maximized answer the next three questions:

[5]
29. If we solve the above linear equations by the graphical method of Linear
Programming, then the following point ____ will not form the boundary of the
feasible region.
a. (6, 0)
b. (4, 0)
c. (4, 3)
d. (0, 6)
30. If we solve the above linear equations by the graphical method of Linear
Programming, then the following point ____ is the optimum solution.
a. (6, 0)
b. (4, 6)
c. (4, 3)
d. (2, 6)
31. If we solve the above linear equations by the graphical method of Linear
Programming, then the binding constraints are:
a. 3x1 + 2x2 = 18, x1 = 4
b. 3x1 + 2x2 = 18, 2x2 = 12
c. x1 = 4, 2x2 = 12
d. 3x1 + 5x2 = 36, 3x1 + 2x2 = 18
32. Simplex problem is considered as infeasible when
a. All the variables in entering column are negative
b. Variables in the basis are negative

[6]
 c. Artificial variable is present in basis
d. Pivotal value is negative
33. In the simplex method, if artificial variables are present in the basis, then the solution
obtained is ――
a. Unbounded Solution
b. Infeasible Solution
c. Degenerated Solution
d. Multiple Solution
34. In the simplex method, if some of the values in the constant column (b) are zero, then
the solution becomes ――
a. Unbounded Solution
b. Infeasible Solution
c. Degenerated Solution
d. Multiple Solution
35. In the simplex method, if the non-basic variable in the final simplex table showing
the optimal solution to a problem, has a net zero contribution, then the condition of
―― arises.
a. Unbounded Solution
b. Infeasible Solution
c. Degenerated Solution
d. Multiple Optimal Solution
36. Based on final table of simplex LPP is said to have alternate solution if in (cj - zj)
row.
a. One or more basic variable has zero value
b. Entering variable has negative coefficient
c. Below a non basic variable there is zero
d. Multiple Optimal Solution
37. The simplex method is used for solving _______ problems.
a. octagonal programming
b. Cartesian correlation
c. queue matching
d. linear programming
38. Simplex method of solving linear programming problem uses.
a. all the points in the feasible region
b. only the corner points of the feasible region
c. intermediate points within the infeasible region
d. only the interior points in the feasible region

[7]
39. One unit of product P1 requires 3 kg of resource R1 and 1kg of resource R2. One unit
of product P2 requires 2 kg of resource R1 and 2kg of resource R2. The profits per unit
by selling product P1 and P2 are $2000 and $3000 respectively. The manufacture has
90 kg of resource R1 and 100 kg of resource R2. The unit worth of resource R2 in $
per kg is:
a. 0
b. 1350
c. 1500
d. 2000
40. While solving an LPP (defined by n variables and m equations, m < n) through
simplex method, basic solutions are determined by setting n – m variables equal to
zero and solving m equations to obtain solution for remaining m variables, provided
the resulting solutions are unique. This means that the maximum number of basic
solutions is:
𝑛!
a.
𝑚!(𝑛−𝑚)!
𝑚!
b.
𝑛!(𝑛−𝑚)!
𝑛!
c.
𝑚!(𝑛+𝑚)!
𝑚!
d.
𝑛!(𝑛+𝑚)!

41. Maximum Z = 5 X1 + 3 X2.

Subject to
X1 + 2 X2 ≤ 10,
X1 – X2 ≤ 8,
X1, X2 ≥ 0.
in the starting Simplex tableau, X1 and X2 are non-basic variables and the value of Z
is zero. The value of Z in the next Simplex tableau is ________.
a. 30
b. 50
c. 40
d. 24
42. If x is a decision variable of LPP and unrestricted in sign then this variable can be
converted into X = X’ – X’’ so as to solve the LPP by simplex method, where:
a. X’ ≤ 0 and X’’ ≥ 0
b. X’ ≥ 0 and X’’ ≤ 0

[8]
 c. X’ and X’’ ≤ 0
d. X’ and X’’ ≥ 0
43. One unit of product P1 requires 3 kg of resource R1 and 1kg of resource R2. One unit
of product P2 requires 2 kg of resource R1 and 2kg of resource R2. The profits per unit
by selling product P1 and P2 are $2000 and $3000 respectively. The manufacture has
90 kg of resource R1 and 100 kg of resource R2. The manufacturer can make a
maximum profit of $.
a. 60000
b. 135000
c. 150000
d. 200000
44. Simplex problem is considered as infeasible when
a. All the variables in entering column are negative.
b. Variables in the basis are negative.
c. Artificial variable is present in basis.
d. Pivotal value is negative.
45. Based on final table of simplex LPP is said to have alternate solution if in (Cj – Zj)
row
a. One or more basic variable has zero value
b. Entering variable has negative coefficient
c. Below a non basic variable there is zero
d. Optimum function value is zero
The shaded area in the following graph represents the feasible region of a linear
programming problem whose objective function is to be maximized. Label each of the
following statements (next three questions) as True or False, and then justify your answer
based on the graphical method. In each case, give an example of an objective function
that illustrates your answer:

[9]
46. False. The optimality of a solution cannot be determined solely based on its value in comparison to
other solutions. It requires additional analysis using the simplex method.

47. True. If multiple optimal solutions exist, any of them can be considered as an optimal solution.

48. False. The point (0, 0) can be an optimal solution if it satisfies the constraints and yields the
maximum objective function value.
46. If (3, 3) produces a larger value of the objective function than (0, 2) and (6, 3), then
(3, 3) must be an optimal solution.
47. If (3, 3) is an optimal solution and multiple optimal solutions exist, then either (0, 2)
or (6, 3) must also be an optimal solution.
48. The point (0, 0) cannot be an optimal solution
49. There are 48 hours of production time available in a given department. The
department produces three products and their production times are as follows: (x—6
minutes), (y—12 minutes), (z—3 minutes). The correct resource availability
constraint is:
a. .10x + .20y + .05z ≤ 48
b. .10x + .20y + .05z ≥ 48
c. 6x + 12y + 3z ≤ 48
d. 6x + 12y + 3z = 48
50. The constraint A ≥ 0.3(A + B + C) may be alternatively written as:
a. 0.7A − 0.3B − 0.3C ≤ 0
b. 0.7A − 0.3B − 0.3C ≥ 0
c. 0.7A − 0.3B − 0.3C = 0
d. 0.3A − 0.3B − 0.3C ≥ 1
51. Let x = number of units of product 1 to produce and let y = number of units of
product 2 to produce. Consider the following objective function: Maximize z = x +
2y. Subject to the following constraints: x + y ≤ 12 (resource A), x ≤ 8 (resource B), y
≤ 6 (resource C), x and y ≥ 0. What will the optimal objective function value be?
a. 30
b. 20
c. 18
d. 8
52. Which of the following statements is true?
a. Changes to an objective function coefficient will affect the size of the feasible
region.
b. Changes to an objective function coefficient will not affect the size of the
feasible region.
c. Changes to an objective function coefficient will growth the feasible region.
d. Changes to an objective function coefficient will reduce the feasible region.
53. Suppose that a MAX problem contained the following constraint: 5x + 8y ≤ 40. Then
which of the following statements is true?
[10]
 a. For the point (1, 4), the slack for this constraint would have a value of 3.
b. For the point (1, 4), the slack for this constraint would have a value of ‒3.
c. For the point (1, 4), the slack for this constraint would have a value of 12.
d. For the point (1, 4), the slack for this constraint would have a value of 11.
54. If a greater than or equal to constraint is used to model a minimum requirement
constraint, then:
a. it will be a binding constraint if the minimum requirement is exactly met.
b. it will be a redundant constraint if the minimum requirement is exactly met.
c. it will be a nonbinding constraint if the minimum requirement is exactly met.
d. It will be a binding entry if the minimum requirements are not completely met.
55. When there is a change in one of the coefficients of the objective function and yet
optimal point remains as the optimal point after the change then:
a. The value of the new optimal objective function will not change and is
generally no different from the original.
b. the value of the new optimal objective function changes and is generally
different to the original.
c. The value of the new optimal objective function will be greater than the
original.
d. The value of the new optimal objective function will be less than the original.
56. Any change in the values for the RHS (Right Hand Side) of a binding constraint of an
LP problem will:
a. change the slope of the constraint and will move it not parallel to the origin.
b. not change the slope of the constraint but move it parallel to the original.
c. neither change the slope of the constraint nor move it parallel to the origin.
d. not change the slope of the constraint and move it not parallel to the original.
57. The shadow price is calculated to be 3 for a less than or equal to constraint in a
maximization LP problem, this means:
a. if the RHS for that constraint is increased by one then the optimal objective
function value is increase by 3 dollars.
b. if the RHS for that constraint is decreased by one then the optimal objective
function value is increase by 3 dollars.
c. if the LHS for that constraint is increased by one then the optimal objective
function value is increase by 3 dollars.
d. if the RHS for that constraint is increased by one then the optimal objective
function value is decrease by 3 dollars.
58. Sensitivity Analysis generally assumes:
a. we are considering a change in only one input data value at a time.
b. we are considering a change in more than one input data value at a time.
[11]
 c. the LHS for that constraint is increased by one then the optimal objective
function value is increase by one dollar.
d. the RHS for that constraint is increased by one then the optimal objective
function value is decrease by three dollars.
59. A non-binding constraint:
a. has a zero-shadow price.
b. has a greater than zero shadow price.
c. has a less than zero shadow price.
d. has a zero-slack value.
60. Improving a minimization LP problem means:
a. decreasing the optimal objective function value.
b. increasing the optimal objective function value.
c. no change in the optimal objective function value.
d. none of the above.
61. Improving a maximization LP problem means:
a. decreasing the optimal objective function value.
b. increasing the optimal objective function value.
c. no change in the optimal objective function value.
d. none of the above.
62. Which of the following statements is true?
a. An optimal solution will never use up all of the resources available.
b. A less than or equal to constraint with positive slack in the optimal solution
will always have an infinite allowable decrease for the RHS.
c. Changing the RHS of a constraint changes its slope
d. Increasing the RHS of a less than or equal to constraint will eventually make it
redundant.
63. The report which shows the final values of the decision variables, the objective
function, and the formula, slack or surplus, status, and LHS value for each constraint
is the:
a. answer report.
b. limits report.
c. constraint report.
d. sensitivity report.
64. 3. Let x = number of units of product 1 to produce and let y = number of units of
product 2 to produce. Consider the following objective function: Maximize z = x +
2y. Subject to the following constraints: x + y ≤ 12 (resource A), x ≤ 8 (resource B), y
≤ 6 (resource C), x and y ≥ 0. What will the optimal objective function value be?

[12]
 a. 16.
b. 12.
c. 10.
d. 18.
65. Refer to Question #64. Suppose the amount resource A available is increased from 12
to 14. Now what will the optimal objective function value be?
a. 24
b. 20
c. 16
d. 18
66. Refer to Question #64. Suppose the amount resource B available is increased from 8
to 10. Now what will the optimal objective function value be?
a. 22
b. 16
c. 18
d. 20
67. Refer to Question #64. What is the shadow price for the resource C constraint?
a. 1
b. 2
c. 3
d. 0
68. Consider a scenario with an objective function Minimize $14X + $17Y. Assume that
the value of X in the optimal solution is zero and the reduced cost for variable X is
$3. At what objective function coefficient will X first become part of the optimal
solution?
a. 11
b. 14
c. 20
d. 17
69. Which of the following statements is true?
a. An equality constraint is always nonbinding
b. Shadow prices can be found in the Answer Report
c. Changes to an objective function coefficient will not affect the size of the
feasible region
d. If a constraint is nonbinding then its LHS is greater than its RHS
70. Suppose that a MAX problem contained the following constraint: 5x + 8y ≤ 40. Then
which of the following statements is true?

[13]
 a. For the point (1, 4), the slack for this constraint would have a value of 3
b. For the point (4, 2), the slack for this constraint would be zero
c. For the point (8, 5), the slack for this constraint would have a value of 40
d. For the point (4, 2.5), the slack for this constraint would be a positive value.
71. If a greater than or equal to constraint is used to model a minimum requirement
constraint, then:
a. it will always be a binding constraint if the objective function is a MAX
b. it will always be a binding constraint if the objective function is a MIN
c. it will be a binding constraint if the minimum requirement is exceeded
d. it will be a binding constraint if the minimum requirement is exactly met
72. When there is a change in one of the coefficients of the objective function and yet
optimal point remains as the optimal point after the change then
a. the value of the new optimal objective function remains the same as original
b. the value of the new optimal objective function changes and is generally
different to the original
73. Any change in the values for the RHS (Right Hand Side) of a binding constraint of an
LP problem will:
a. not change the feasibility region
b. change the slope of the that constraint
c. change the slope of the objective function
d. not change the slope of the constraint but move it parallel to the original
74. The shadow price is calculated to be 3 for a less than or equal to constraint in a
maximization LP problem, this means:
a. if the RHS for that constraint is increased by three then the optimal objective
function value is increase by 1 dollars
b. if the coefficient of the objective function is increase by 3 then the RHS for
that constraint must be increased by 1
c. if the RHS for that constraint is increased by one then the optimal objective
function value is increase by 3 dollars
d. if the coefficient of the objective function is increase by 1 then the RHS for
that constraint must be increased by 3
75. The options under Solver in Excel that should always be check (turned on) for the
general LP problem are the following
a. only 'Assume Non-Negative'
b. only 'Assume Linear Model'
c. both 'Assume Linear Model' and 'Assume Non-Negative'
d. neither 'Assume Linear Model' nor 'Assume Non-Negative'

[14]
76. Sensitivity Analysis generally assumes:
a. we are considering a change in only one input data value at a time
b. we are considering a change in two input data values at a time
c. we are considering several change in several input data values at a time
77. The Sensitivity Report from Solver represents infinity by:
a. displaying a large number like 1E+30
b. displaying the letter M
c. displaying a large number like 1000
d. displaying the word 'infinity'
78. A non-binding constraint;
a. the slack for that constraint is zero
b. has a non-zero shadow price
c. has a zero shadow price
d. mean that all the resources for that constraint are used
79. The case where there are alternate solutions or multiple optimal solutions is mostly
identified in solver when:
a. shadow prices are all non-zero
b. when the Allowable Increase or Allowable Decrease column for the OFC of a
variable has a value of zero in the Adjustable Cells Table
c. shadow prices are zero
d. when the Allowable Increase or Allowable Decrease column for the RHS of a
variable has a value of zero in the Constraints Table
80. Improving a minimization LP problem means:
a. increasing the optimal objective function value
b. decreasing the optimal objective function value
81. True or False?
a. To balance a transportation model, it is necessary to add a dummy source or a
dummy destination but never both.
b. The amounts shipped to a dummy destination represent surplus at the shipping
source.
c. The amounts shipped from a dummy source represent shortages at the receiving
destinations.
82. In each of the following cases, determine whether a dummy source or a dummy
destination must be added to balance the model.
a. Supply: a1 = 100, a2 = 50, a3 = 40, a4 = 60
Demand: b1 = 100, b2 = 50, b3 = 70, b4 = 90

Dummy destination. [15]

 Dummy source.
b. Supply: a1 = 15, a2 = 44
Demand: b1 = 25, b2 = 15, b3 = 10
83. When total supply is equal to total demand in a transportation problem, the problem
is said to be
a. balanced
b. unbalanced
c. degenerate
d. none of the above
84. The degeneracy in the transportation problem indicates that
a. dummy allocation(s) needs to be added
b. the problem has no feasible solution
c. the multiple optimal solution exists
d. a & b but not c
85. The dummy source or destination in a transportation problem is added to
a. satisfy balance conditions
b. prevent solution from becoming degenerate
c. ensure that total cost does not exceed a limit
d. none of the above
86. 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 the above
87. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns
(destination) is feasible if number of positive allocations are
a. m + n
b. m × n
c. m + n – 1
d. m + n + 1
88. if 6 × 6 transportation problem degeneracy will not arise if the number of allocations
are
a. 36
b. > 11
c. 11
d. < 11
89. When total supply is equal to total demand in a transportation problem, the problem

[16]
 is said to be
a. balanced
b. unbalanced
c. degenerate
d. none of the above
90. The main objective of TP is:
a. To minimize the total cost of transportation
b. To minimize the total time taken
c. Either a or b
d. Neither a nor b
91. Transportation problem plays an important role among the various techniques of
a. Non-Parametric tests
b. Assignment Problems
c. Operations Research
d. Parametric tests
92. What is the meaning of balanced TP?
a. No. of rows = No. of columns
b. No. of supply = No. of demand
c. Total of supply = Total of demand
d. Any of the above
93. In TP, ------ are shown against origins.
a. Demand
b. Supply
c. a or b
d. Willingness
94. If the total of supply is ------ the total of demand, it is called an unbalanced TP.
a. Not equal to
b. Is more than
c. Is less than
d. Any of the above
95. If the total of supply is more than the demand, then ------.
a. Make a dummy row/column of supply
b. Make a dummy row/column of demand
c. Make a dummy row/column of both supply and demand
d. None of these.
96. The method which gives feasible solution close to the optimal solution
a. Matrix Minima method

[17]
 b. Vogel’s method
c. Min (Min=Max) method
d. Modi Method
97. The full form of VAM is
a. Vogel’s Appropriate Method
b. Vogel’s Approximate Method
c. Vogel’s Approximation Method
d. None
98. The full form of IBFS is
a. Initial Basic Function Solution
b. Initial Basical Feasible Solution
c. Initial Basic Feasible Solution
d. None of the above
99. In Matrix Minima method, the units are allocated to the ------ cost among all the costs
a. Maximum
b. Minimum
c. Next to minimum cost
d. Any cost
100. In Matrix Minima method is also called as
a. Least cost method
b. North west corner method
c. Min (Min-Max) method
d. All of the above
101. In which method, penalties or differences are found?
a. MODI method
b. Least cost method
c. Min (Min-Max) method
d. Vogel’s Approximation Method
102. ------ method can be used for finding optimal solution of TP.
a. Vogel’s Approximation Method
b. MODI method
c. Hungarian method
d. Matrix Minima method
103. MODI method is also called ------
a. Vogel’s Approximation Method
b. UV method
c. Maximization Problem

[18]
 d. Simplex Method
104. In a TP, when the no. of occupied cells is less than no. of rows plus no. of columns
minus one, we say that the solution is ------
a. Degenerate
b. Infeasible
c. Optimal
d. Unbalanced
105. The table represents that the solution is ------
a. Degenerate
b. Optimal
c. Infeasible
d. Balanced
D1 D2 D3 Supply
O1 3 40 6 4 40
O2 3 30 4 5 30
O3 20 5 7 10 6 30
Demand 20 70 10 100
106. In case of unbalanced problem, shipping cost coefficients of ------ are assigned to
each created dummy factory or warehouse.
a. Very high positive costs
b. Very high negative costs
c. 10
d. Zero
107. In applying Vogel’s Approximation Method, row and column penalties are
determined by.
a. Finding the sum of smallest and highest costs
b. Finding the difference of smallest costs
c. Finding the difference of highest costs
d. Finding the sum of smallest costs
108. The table represents that the solution is ------
a. 2212
b. 2220
c. 2221
d. 2223
D1 D2 D3 D4 Supply
O1 23 27 16 30 18 30
O2 5 12 35 17 20 51 40
O3 17 22 28 25 12 11 32 53
[19]
 Demand 22 35 25 41 123
109. In a transportation problem with 4 supply points and 5 demand points, how many
numbers of constraints are required in its formulation?
a. 20
b. 1 8
c. 0
d. 9
110. Vogel’s approximation method is connected with
a. Assignment problem
b. Inventory problem
c. Transportation problem
d. PERT
111. In a transportation problem there are four supply and five demand centers. The total
quantity of supply available is greater than total demand. The number of allocations
without degeneracy during an iteration is
a. 3
b. 6
c. 9
d. 8
112. Which of the following method is used for obtaining an initial basic feasible solution
to the transportation problem?
a. North west corner method a,b,d
b. Vogel’s approximation method
c. Modified Distribution Method
d. Least cost method
113. Which of the following method is used for checking the optimality?
a. North west corner method
b. Vogel’s approximation method
c. Modified Distribution Method
d. Least cost method
114. The Hungarian method is
a. a way to develop an initial solution to a transportation problem.
b. used to solve assignment problems.
c. also called Vogel’s approximation method.
d. only used for problems in which the objective is to maximize profit.
115. In an assignment problem, it may be necessary to add more than one row to the table.
a. True

[20]
 b. False
116. When using the Hungarian method, an optimal assignment can always be made when
every row and every column has at least one zero.
a. True
b. False
117. An assignment problem can be viewed as a special type of transportation problem
with which of the following features?
a. the capacity for each source and the demand for each destination is equal to one
b. the number of rows is equal to the number of columns
c. the cost for each shipping route is equal to one
d. all of the above
118. Five employees are available to perform four jobs. The time it takes each person to
perform each job is given in the next Table. Determine the assignment of employees
to jobs that minimizes the total time required to perform the four jobs.

119. The Chicago board of education is taking bids on the city’s four school bus routes.
Four companies have made the bids in the next Table.

[21]
 a. Suppose each bidder can be assigned only one route. Use the assignment method
to minimize Chicago’s cost of running the four bus routes.
b. Suppose that each company can be assigned two routes. Use the assignment
method to minimize Chicago’s cost of running the four bus routes. (Hint: Two
supply points will be needed for each company.)
120. Any transportation problem can be formulated as an assignment problem. To
illustrate the idea, determine an assignment problem that could be used to find the
optimal solution to the transportation problem in the next Table. (Hint: You will need
five supply and five demand points).

Multiple Choice Questions (MCQ)

121. The application of assignment problems is to obtain _________.
a. only minimum cost.
b. only maximum profit.
c. minimum cost or maximum profit.
d. assigns the jobs.
122. The assignment problem is said to be unbalanced if _________.
a. number of rows is greater than number of columns.
b. number of rows is lesser than number of columns.
c. number of rows is equal to number of columns.

[22]
 d. both a and b.
123. The assignment problem is said to be balanced if _________.
a. number of rows is greater than number of columns.
b. number of rows is lesser than number of columns.
c. number of rows is equal to number of columns.
d. if the entry of row is zero.
124. The assignment problem is said to be balanced if it is _________.
a. square matrix.
b. rectangular matrix.
c. unit matrix.
d. triangular matrix.
125. In assignment problem if number of rows is greater than column then _________.
a. dummy column is added.
b. dummy row added.
c. row with cost 1 is added.
d. column with cost 1 is added.
126. In assignment problem if number of columns is greater than row then _________.
a. dummy column is added.
b. dummy row added.
c. row with cost 1 is added.
d. column with cost 1 is added.
127. 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______.
a. rows or columns.
b. rows and columns.
c. rows + columns- 1.
d. rows-columns.
128. While solving an assignment problem, an activity is assigned to a resource through a
square with zero opportunity cost because the objective is to_________.
a. minimizes total cost of assignment.
b. reduces the cost of assignment to zero.
c. reduces the cost of that particular assignment to zero.
d. reduces total cost of assignment.
129. Maximization assignment problem is transformed into a minimization problem
by_________.
a. Adding each entry in a column to the maximum value in that column.
b. Subtracting each entry in a column from the maximum value in that column.

[23]
 c. Subtracting each entry in the table from the maximum value in that table.
d. Adding each entry in the table to the maximum value in that table.
130. The assignment problem is a special case of transportation problem in
which_________.
a. Number of origins are equal the number of destinations.
b. Number of origins are less than the number of destinations.
c. Number of origins are greater than the number of destinations.
d. Number of origins are greater than or equal the number of destinations.
131. Identify the correct statement.
a. An assignment problem may require the introduction of both dummy row and
dummy column.
b. An assignment problem with m rows and n columns will involves a total of m × n
possible assignments.
c. An unbalanced assignment is one where the number of rows is mor than or less
than the number of columns.
d. Balancing any unbalanced assignment problem involves adding one dummy row /
column.
132. The minimum number of lines covering all zeros in reduced cost matrix of order n
can be _______.
a. At most n.
b. At least n.
c. n – 1.
d. n + 1.
133. In an assignment problem involving 5 workers and 5 jobs, total number of
assignments possible are_______.
a. 5!.
b. 10.
c. 25.
d. 5.
134. In marking assignment, which of the following should be preferred?
a. Only row having single zero.
b. Only column having single zero.
c. Only row / column having single zero.
d. Column having more than one zero.
135. The Hungarian method used for finding the solution of the assignment problem is
also called_______.
a. Reduced matrix method.

[24]
 b. Matrix minima method.
c. MODI method.
d. Simplex method.
136. The assignment algorithm was developed by_______.
a. Modi.
b. Kuhn.
c. Hungarian.
d. Vogel’s.
137. In an assignment problem.
a. One agent can do parts of several tasks.
b. One task can be done by several agents.
c. each agent is assigned to its own best task.
d. None of the above.
138. 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 the above
139. An optimal assignment requires that the maximum number of lines that can be
drawn through squares with zero opportunity cost be equal to the number of
a. Rows or columns
b. Rows and columns
c. Rows + columns – 1
d. None of the above
140. While solving an assignment problem, an activity is assigned to a resource through
a square with zero opportunity cost because the objective is to
a. Minimize total cost of assignment
b. Reduce the cost of assignment to zero
c. Reduce the cost of that particular assignment to zero
d. All of the above
141. The purpose of a dummy row or column in an assignment problem is to
a. Obtain balance between total activities and total resources
b. Prevent the solution from becoming degenerate
c. Provide a means of representing a dummy problem
d. None of the above

[25]
 142. Maximization assignment problem is transformed into a minimization assignment
problem by
a. Adding each entry in a column to the maximum value in that column
b. Subtracting each entry in a column from the maximum value in that column
c. Subtracting each entry in the table from the maximum value in that table
d. Any one of the above
143. If there ware n workers and n jobs there would be
a. n! solutions
b. (n – 1)! solutions
c. (n!)n solutions
d. n solutions
144. an assignment problem can be solved by
a. simplex method
b. transportation method
c. both (a) and (b)
d. none of the above
145. the assignment problem
a. Requires that only one activity be assigned to each resource
b. Is a special case of transportation problem
c. Can be used to maximize resources
d. All of the above
146. An assignment problem is a special case of transportation problem, where
a. The number of rows equals columns
b. All rim conditions are 1
c. Values of each decision variable is either 0 or 1
d. All of the above
147. The Hungarian method for solving an assignment problem can also be used to solve
a. A transportation problem
b. A travelling salesman problem
c. Both (a) and (b)
d. Only (b)
148. What is PERT analysis based on?
a. Optimistic time
b. Pessimistic time
c. Most likely time
d. All of the above
149. Which of the options is not a notable challenge while scheduling a project?
a. Deadlines exist

[26]
 b. Independent activities
c. Too many workers may be required
d. Costly delay
150. What is the particular task performance in CPM known as?
a. Dummy
b. Event
c. Activity
d. Contract
151. What is the earliest start time rule?
a. It compares the activity’s starting time for an activity successor.
b. It compares the activity’s end time for an activity predecessor.
c. It directs when a project can start.
d. It regulates when a project must begin.
152. What is a critical path?
a. It is a path that operates from the starting node to the end node.
b. It is a mixture of all the paths
c. It is the longest path
d. It is the shortest path
153. What is the completion of a CPM network diagram activity commonly known as?
a. Connector
b. Event
c. Node
d. All of the above
154. Activities A, B, and C are the immediate predecessors for Y activity. If the earliest
finishing time for the three activities are 12, 15, and 10, then what will be the earliest
starting time for Y?
a. 10
b. 15
c. 12
d. Cannot be determined
155. Activities P, Q, and R instantly follow activity M, and their current starting times are
12, 19, and 10. So, what is the latest finishing time for activity M?
a. 11
b. 10
c. 18
d. Cannot be determined
156. Activity in a network diagram is represented by?
a. Rectangles
b. Arrows
[27]
 c. Squares
d. Circles
157. What happens when a project is scheduled by CPM?
a. A project is divided into various activities
b. Required time for each activity is established
c. A sequence of various activities is made according to their importance
d. All of the above
158. Slack time in PERT analysis__________
a. Can never be greater than zero
b. Can never be less than zero
c. Is minimum for critical events
d. None of above
159. Which of the following statements regarding cpm networks is true?
a. Allows you to compare the planned and the actual progress.
b. Helps the team stay focused on the main thing.
c. Prioritizes tasks
d. All of the above
160. The earliest start time rule____________
a. Regulates when a project must begin
b. Compares the activities end time for an activity predecessor
c. Compares the activities starting time for an activity successor
d. Directs when a project can start
161. Which of the following statements regarding pert analysis is true?
a. Each activity has three estimates of its duration.
b. Project variance is the sum of all critical activity variances.
c. The most likely time is different from the expected activity time.
d. Only critical activities contribute to the project variance.
162. The slack time refers to
a. An activity
b. An event
c. Both event and activity
d. None of the above
163. For an activity in CPM analysis, the early Finish time is 13 and the late Finish time is
13, Duration of activity is 6. What of the following statements is true?
a. The early start time is 6
b. The duration of the activity is 13
c. The slack of this activity is 13
d. The activity on the critical path
164. Total float of an activity is difference between
[28]
 a. Early Finish and Late Finish
b. Free Float and Interference Float
c. Duration and Early Start
d. Independent Float and the Activity
165. An activity which consumes no resources is called
a. Start Activity
b. Critical Activity
c. Dummy Activity
d. End Activity
166. When resources required by activities are deterministic the method used in Project
Management is called
a. PERT
b. AOA
c. CPM
d. Event Management
167. Which of the following is not an activity on site
a. Critical activity
b. Normal activity
c. Dummy activity
d. Urgent activity
168. The numbering of the nodes in A-O-A is done
a. From left to right
b. From Right to Left
c. Randomly
d. On the basis of the duration of the activity
169. One of the conventions used in network construction is
a. CPM
b. PERT
c. AON
d. CPI
170. In PERT (Project Evaluation and Review Technique) method Expected time (Te) is
a. (To+Tp+4Tm)/6
b. (To+Tp+2Tm)/6
c. (To+Tp+Tm)/6
d. (Tm+Tp+4To)/6
171. PERT (Project Evaluation and Review Technique) analysis is based on
a. Optimistic time, Pessimistic time and Most likely time
b. Pessimistic time, Optional time, Maximum time
c. Optimistic time, Efficient time, Most likely time
[29]
 d. Minimax time, Optimistic time and harmonic time
172. The critical path
a. Is a path that operates from the starting node to the end node
b. Is a mixture of all paths.
c. Is the longest path
d. Is the shortest path
173. The particular task performance in CPM is known
a. Dummy
b. Event
c. Activity
d. Contract.

174. In Project management when does planning take place?

a. Before the project
b. During the project execution
c. At the start of the project
d. After the project
175. Which one of the following is captured in the Work Breakdown Structure (WBS)?
a. The life cycle phases
b. The logical order of tasks
c. The scope of the project
d. Project costs
176. New project idea can be received by a company from
a. Internal sources only
b. External sources only
c. Project Team only
d. A & B

177. The time by which the completion of an activity can be delayed without affecting the
start of succeeding activities is called
a. total float
b. interfering float
c. independent float
d. free float
178. Slack time refers to
a. an activity
b. an event
c. both event and activity
d. none of the above.
[30]
179. In PERT, the critical path represents the
a. shortest path for the earliest completion of project
b. the longest path of the network from the initial to the final event
c. the ideal path by proceeding along which the project can be completed as per
schedule
d. the path which takes into account the completion of the parallel activities
180. Slack is given as the difference between
a. latest allowable time and earliest expected time
b. latest allowable time and pessimistic time estimate
c. earliest expected time and latest allowable time
d. final event time and initial event time
181. The time by which the completion of an activity can be delayed without affecting the
start of succeeding activities is called
a. total float
b. interfering float
c. independent float
d. free float
182. Float may be defined as the difference between
a. latest start time and the earliest start time
b. latest finish time and the earliest finish time
c. time available and the time required to completed the activity
d. all of the above
183. Which one of the following statements is correct for every activity in a network?
a. Interference float can never be negative
b. Independent float can exceed free float
c. Total float can exceed free float
d. Interference float and independent float may be equal to each other in
magnitude
184. The full form of PERT method of project network analysis is:
a. Project Estimation and Review Technique
b. Program Evaluation and Review Technique
c. Project Estimation and Report Technique
d. Partial Evaluation and Review Technique
185. The full form of acronym CPM is:
a. Construction Project Method
b. Critical Project Method
c. Critical Path Method
d. Critical Program Method
186. The CPM network analysis is a ______ based method useful for ________.
[31]
 a. activity, research and development projects
b. event, construction projects
c. event, research and development projects
d. activity, construction projects
187. The PERT network analysis is a ______ based method useful for ________.
a. activity, research and development projects
b. event, construction projects
c. event, research and development projects
d. activity, construction projects
188. Pessimistic time and optimistic time of completion of an activity are given as 10 days
and 4 days respectively, the variance of the activity will be
a. 1
b. 6
c. 12
d. 18
189. The time by which the activity completion time can be delayed without affecting the
start of succeeding activities is known as
a. Duration
b. Total float
c. Free float
d. Interfering float
190. In constructing project planning, free float can affect which of the following?
a. Only that particular activity
b. Succeeding activity
c. Overall completion
d. Preceding activity
191. The amount of time by which an activity can be delayed without affecting project
completion time is
a. Free float
b. Total float
c. Independent float
d. Activity float
192. Activity A, B, and C are the immediate predecessors for Y activity. If the earliest
activities are 12, 15, and 10, then the earliest start time for Y will be
a. 10
b. 15
c. 12
d. Can not be determined
193. Activities P, Q and R instantly follow activity M, and their latest start time are 12, 19,
[32]
 and 10. Therefore, the latest finish time for activity M is
a. 12
b. 18
c. 10
d. 19
194. PERT and CPM are
a. project evaluation techniques
b. assignment techniques
c. network techniques
d. all of the above
195. The basic difference between PERT and CPM is that
a. PERT deals with events and CPM with activities
b. Critical path is determined in PERT only
c. Costs are considered on CPM only and not in PERT
d. Guessed times are used in PERT and evaluated times in CPM
196. Actual performance of a task is called
a. An event
b. An activity
c. A duration
d. None of these
197. Which of the following statement is correct about the network diagram?
a. The events are represented graphically by circles or nodes at the beginning and
the end of activity by arrows.
b. The tail end of the arrow represents the start of an activity.
c. The head of the arrow represents the end of an activity.
d. All of the above
If the next table is the Final Simplex tableau, then answer the following questions:

198. The solution is:

a. Optimal Solution
b. Degenerated Solution
c. Infeasible Solution
[33]
 d. Unbounded Solution
199. The solution is:
a. Z=36, s1=2, x2=6, x1=2
b. Z=30, s1=0, x2=1/3, x1=2
c. Z =3/2, s2=2, s3=1, x2=0
d. Z=–36, s1=2, x2=6, x1=2
200. The unused amounts of resource (1) is:
a. 3/2
b. 0
c. -1/3
d. 2
201. The unused amounts of resource (2) is:
a. 3/2
b. 0
c. -1/3
d. 2

[34]