Adama Science and Technology University

School of Applied Natural Science

Department of Applied Mathematics
Exit_ Tutorial of Linear Optimization
(Math2208)

MULTIPLE CHOICE QUESTIONS

1. Which of the following is a Linear programming assumptions
a) The Proportionality
b) Additivity Assumptions.
c) The Divisibility Assumption.
d) The Certainty Assumption.
e) All of the above

2. Which of the following is a type of Linear programming problem?

a) Manufacturing problem
b) Diet problem
c) Transportation problems
d) All of the above

3. The linear inequalities or equations or restrictions on the variables of a linear

programming problem are called:

a) a constraint
b) Decision variables
c) Objective function
d) None of the above

4. The objective function of a linear programming problem is:

a) a constraint
b) function to be optimised
c) A relation between the variables
d) None of these

5. Infeasibility in a linear programming problem occurs when:

a) there is an infinite solution,

b) a constraint is redundant,
c) more than one solution is optimal,
d) the feasible region is unbounded,
e) there is no solution that satisfies all the constraints given.

1
6. When appropriate, the optimal solution to a maximization linear programming
problem can be found by graphing the feasible region and:
a) finding the profit at every corner point of the feasible region to see which one
gives the highest value
b) moving the iso-profit lines towards the origin in a parallel fashion until the
last point in the feasible region is encountered.
c) locating the point that is highest on the graph.
d) none of the above.
e) all of the above.
7. The corner point solution method:
a) will always provide one, and only one, optimum solution.
b) will yield different results from the iso-profit line solution method.
c) requires that the profit from all corners of the feasible region be compared.
d) requires that all corners created by all constraints be compared.
e) will not provide a solution at an intersection or corner where a non-negativity
constraint is involved.

8. The optimal value of the objective function is attained at the points:

a) on X-axis
b) on Y-axis
c) corner points of the feasible region
d) none of these

9. In graphical representation the bounded region is known as __________ region.

a) Solution
b) basic solution
c) feasible solution
d) Optimal

10. Graphical method of linear programming is useful when the number of decision
variable are ______________

a) 2 b) 3 c) 4 d)5

11. In LPP the condition to be satisfied is

a) Constraints have to be linear

b) Objective function has to be linear
c) none of the above
d) both a and b

2
12. Consider the following linear programming problem; the feasible corner points are
(48, 84), (0, 120), (0, 0), (90, 0). then, what is the maximum possible value for
the objective function?
Maximize 𝑧 = 4𝑥1 + 10𝑥2 ,

𝑆. 𝑡. 3𝑥1 + 4𝑥2 ≤ 480,

4𝑥1 + 2𝑥2 ≤ 360,
𝑥1 ≥ 0, 𝑥2 ≥ 0

a) 1032 b) 1200 c) 360 d) 1600 e) none of the above

13. The cost of a surplus variable is ______________.
a) 0 b) 1 c) 2 d) -1
14. The dual of the dual is ______________.
a) dual-primal
b) primal-dual
c) Dual
d) primal

15. Consider the following linear programming problem:

Maximize 𝑧 = 5𝑥1 + 6𝑥2 ,

𝑆. 𝑡. 4𝑥1 + 2𝑥2 ≤ 420,

𝑥1 + 2𝑥2 ≤ 120,
𝑥1 ≥ 0, 𝑥2 ≥ 0.

Which of the following points ( 𝑥1 , 𝑥2 ) is not a feasible corner point?

a) (0, 60) b) (105, 0) c) (120, 0) d) (100, 10) e) none of the above.

16. Consider the following linear programming problem:

Maximize 𝑧 = 20𝑥1 + 30𝑥2 ,

𝑆. 𝑡. 2𝑥1 + 4𝑥2 ≤ 800,

6𝑥1 + 3𝑥2 ≤ 300,
𝑥1 ≥ 0, 𝑥2 ≥ 0.

What is the optimum solution to this problem ( 𝑥1 , 𝑥2 )?

a) (0, 0) b) (50,0) c) (0,100) d) (400,0) e) none of the above.

17. Consider the following linear programming problem:

Maximize 𝑧 = 20𝑥1 + 30𝑥2 ,

𝑆. 𝑡. 𝑥1 + 𝑥2 ≤ 80,
8𝑥1 + 9𝑥2 ≤ 600,
3
 3𝑥1 + 2𝑥2 ≥ 400,
𝑥1 ≥ 0, 𝑥2 ≥ 0.

This is a special case of a linear programming problem in which:

a) there is no feasible solution.

b) there is a redundant constraint.
c) there are multiple optimal solutions.
d) this cannot be solved graphically.
e) none of the above.
18. Deleting a constraint from a linear programming (maximization) problem may
result in:

a) a decrease in the value of the objective function.

b) an increase in the value of the objective function.
c) no change to the objective function.
d) either (c) or (a) depending upon the constraint.
e) either (c) or (b) depending upon the constraint.
19. Which of the following is not acceptable as a constraint in a linear programming
problem:

Constraint “1” 𝑥1 + 𝑥1 𝑥2 + 𝑥2 ≥ 12
Constraint “2” 𝑥1 – 2𝑥2 ≤ 20
Constraint “3” 𝑥1 + 3𝑥2 = 48
Constraint “4” 𝑥1 + 𝑥2 + 𝑥3 ≤ 150

a) Constraint “1”
b) Constraint “2”
c) Constraint “3”
d) Constraint “4”
20. If the addition of a constraint to a LP problem does not change the solution, the
constraint is said to be:
a) unbounded.
b) non-negative.
c) infeasible.
d) redundant.
e) bounded.
21. Consider the following LP problem: Which of the following points ( 𝑥1 , 𝑥2 ) is
feasible?

Maximize 𝑧 = 12𝑥1 + 10𝑥2 ,

𝑆. 𝑡. 4𝑥1 + 3𝑥2 ≤ 480,

2𝑥1 + 3𝑥2 ≤ 360,
𝑥1 ≥ 0, 𝑥2 ≥ 0.

4
 a) (10, 120) b) (120, 10) c) (30, 100) d) (60,90) e) none of the
above.
22. Which of the following is true about convex set?
a) The intersection of any finite number of convex sets is also a convex set.
b) The solution set of a system of linear equations (inequalities) is a convex
set.
c) The solution set of constraints for linear programming problem (set of
feasible solutions) is a convex set.
d) All of the above
23. Intersection of convex sets
a) is not a convex set
b) may be a convex set
c) is a convex set
d) cannot be determined
24. Which of the following is/are non-convex set(s)?
a) x-axis,
b) ℝ2 \{(0, 0)}
c) Unit Circle
d) a and c
e) b and c
25. The ”union of convex sets:
a) is always convex set
b) may be a convex set
c) is never a convex set
d) cannot be determined

THE SIMPLEX METHOD

26. Which of the following is NOT true about slack variables in a simplex tableau?

a) they are used to convert “≤ “ constraint inequalities to equations.

b) they represent unused resources.
c) they require the addition of an artificial variable.
d) they may represent machine time, labor hours, or warehouse space.
e) they yield no profit.
27. In LP problems with more than two real variables, the area of feasible solutions is
known as an n-dimensional________________.

a) pentagon
b) cube.
c) octagon.
d) hydra.
e) polyhedron
28. How should the constraint, 𝑥1 – 2𝑥2 ≥ 6 , be converted into simplex tableau
form?
5
 a) 5𝑥1 – 2𝑥2 + 𝑠1 + 𝑎1 = 6
b) 5𝑥1 – 2𝑥2 − 𝑠1 + 𝑎1 = 6
c) 5𝑥1 – 2𝑥2 − 𝑠1 = 6
d) 5𝑥1 – 2𝑥2 + 𝑎1 = 6
e) none of the above.
29. The 𝐶𝑗 – 𝑍𝑗 row of a simplex tableau gives:

a) the number of units of each basic variable that must be removed from the
solution if a new variable is entered.
b) the gross profit or loss given up by adding one unit of a variable into the
solution.
c) the net profit or loss that will result from introducing one unit of the variable
indicated in that column into the solution.
d) the maximal value a variable can take on and still have all the constraints
satisfied
e) none of the above.
30. How should the constraint, 𝑥1 – 2𝑥2 = 6 , be converted into simplex tableau
form?
a) 5𝑥1 – 2𝑥2 + 𝑎1 = 6
b) 5𝑥1 – 2𝑥2 − 𝑎1 = 6
c) 5𝑥1 – 2𝑥2 + 𝑎1 − 𝑎2 = 6
d) 5𝑥1 – 2𝑥2 + 𝑠1 = 6
e) 5𝑥1 – 2𝑥2 − 𝑠1 = 6
31. Shadow prices represent
a) the value of one additional unit of a basic variable.
b) the value of one less unit of a basic variable.
c) the value of one less unit of a specific resource.
d) the value of one additional unit of a specific resource.
e) none of the above
32. Using the simplex method, we know we have an optimal solution when:
a) all slack variables have a zero value.
b) all basic variables are negative.
c) when all the real variables have a non-zero value.
d) when all the artificial variables have a positive value.
e) none of the above.
33. A linear programming problem having 6 main constraints and 3 non-negativity
constraints. Find the upper bound for the number of extreme point candidates.
a) 504 b) 120 c) 20 d) 84

34. Consider the following LP problem:

Maximize 𝑧 = 40𝑥1 + 30𝑥2 + 60𝑥3 ,

𝑆. 𝑡. 𝑥1 + 𝑥2 + 𝑥3 ≥ 90,
12𝑥1 + 8𝑥2 + 10𝑥3 ≤ 1500,
𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0.

6
 How many slack, surplus, and artificial variables would be necessary if the
simplex method were used to solve this problem?
a) 3 slack, 3 surplus, and 3 artificial
b) 1 slack, 2 surplus, and 2 artificial
c) 1 slack, 4 surplus, and 4 artificial
d) 1 slack, 1 surplus, and 1 artificial
e) none of the above.
35. Which of the following is TRUE about surplus variables in a simplex tableau?
a) they are used to convert “ ≤ “ constraint inequalities to equations.
b) they require the addition of an artificial variable.
c) they represent unused resources.
d) they should be added to the left-hand side of the equation.
e) they yield a positive profit.
36. In applying the simplex solution procedure to a maximization problem to
determine which variable enters the solution mix (basis):
a) pick the one with the largest positive 𝐶𝑗 – 𝑍𝑗
b) pick the one with the smallest 𝐶𝑗 – 𝑍𝑗
c) pick the one with the largest 𝐶𝑗
d) pick the one with the smallest𝑍𝑗
e) pick the smallest non-negative number formed by dividing each amount in
the “quantity” column by the appropriate column at the exiting variable.
37. Nonbasic variables in the simplex method of LP are:
a) variables in the solution mix.
b) variables not in the solution mix.
c) the real variables in the initial solution.
d) the slack variables in the optimum solution.
e) always the slack, surplus, and artificial variables.
38. A solved LP problem indicated that the optimal solution was 𝑥1 = 5, 𝑥2 =
10, 𝑎1 = 40. The first constraint was: 4𝑥1 + 2𝑥2 ≥ 80 . This solution is:

a) indeterminant.
b) degenerate.
c) infeasible.
d) unbounded.
e) none of the above.
f)
39. Variables in the solution mix are called_________________.

a) standard.
b) surplus.
c) real.
d) revealed.
e) basic.

40. Consider the following linear programing problem

7
 Maximize 𝑍 = 2 𝑥 1 − 𝑥2 + 𝑥3 ,
subject to
3 𝑥1 + 𝑥 2 + 𝑥 3 ≤ 60
𝑥1 − 𝑥 2 + 2𝑥 3 ≤ 10
𝑥1 + 𝑥 2 − 𝑥 3 ≤ 20

𝑥1 , 𝑥2 , 𝑥1  0.
The optimal solution and optimal Value is
a) (𝑥1 , 𝑥2 , 𝑥3 ) = (15, 5, 0) & 𝑧 = 25
b) (𝑥1 , 𝑥2 , 𝑥3 ) = (15, 0, 5) & 𝑧 = 35
c) (𝑥1 , 𝑥2 , 𝑥3 ) = (5 ,5, 10) & 𝑧 = 15
d) None
41. The dual optimal solution of Q#40 is
a) (𝑦1 , 𝑦2 , 𝑦3 ) = (3/2, 1/2, 0)
b) (𝑦1 , 𝑦2 , 𝑦3 ) = (0, 3/2, 1/2).
c) (𝑦1 , 𝑦2 , 𝑦) = (1/2 ,0, 3/2)
d) None

42. If, in the final optimal simplex tableau, the 𝐶𝑗 – 𝑍𝑗 value for a nonbasic variable is
zero, this implies:
a) infeasibility.
b) unboundedness.
c) Degeneracy
d) alternate optimal solutions.
e) none of the above.
43. The substitution rates:
a) decrease with each iteration of the simplex method.
b) tell us the number of units of a basic variable that must be removed from
the solution for another variable to enter the basis.
c) tell the amount of one resource that can be substituted for another.
d) tell us the amount of a resource that must be used to gain another unit of
profit.
e) none of the above.
44. The number “ -2 “ in the 𝑥2 column and 𝑥1 row of a simplex tableau implies that:
a) if 1 unit of 𝑥2 is added to the solution, 𝑥1 will decrease by 2.
b) if 1 unit of 𝑥1 is added to the solution, 𝑥2 will decrease by 2.
c) if 1 unit of 𝑥2 is added to the solution, 𝑥1 will increase by 2.
d) if 1 unit of 𝑥1 is added to the solution, 𝑥2 will increase by 2.
45. A slack variable:
a) is added to each ≤ constraint to facilitate the simplex process.
b) is added to each ≥ constraint to facilitate the simplex process.
c) is added to each ≤ or = constraint to facilitate the simplex process.
d) is added to each = constraint to facilitate the simplex process.
e) none of the above.
46. In applying the simplex solution procedure to a minimization problem to
determine which variable enters the solution mix:
8
 a) pick the one with the most positive 𝐶𝑗 – 𝑍𝑗 .
b) pick the one with the largest 𝐶𝑗 j.
c) pick the one with the smallest 𝑍𝑗 .
d) pick the one with the most negative 𝐶𝑗 – 𝑍𝑗
e) pick the smallest nonnegative number formed by dividing each amount in
the quantity column by the appropriate column at the exiting variable.
47. If, in the optimal tableau of a linear programming problem, an artificial variable is
present in the solution mix, this implies:
a) infeasibility.
b) unboundedness.
c) degeneracy.
d) alternate optimal solutions.
e) a finite optimal solution.

48. Given the following Linear programming problem with optimal simplex
tableau
Maximize Z  3x1  2 x2
subject to 2 x1  x2  100
x1  x2  80
x1  40
𝑥1 , 𝑥2 ≥ 0

Right
BV
Z x1 x2 S1 S2 S3 Side
Z 1 0 0 1 1 0 180
x2 0 0 1 -1 2 0 60
s3 0 0 0 -1 1 1 20
x1 0 1 0 1 -1 0 20
Then, find range of optimality for 𝑏1 if the right hand side of constraint one is
changed to 100 + ∆𝑏1
a) −20 ≤ 𝑏1 ≤ 20
b) 80 ≤ 𝑏1 ≤ 120
c) −20 ≤ 𝑏1 ≤ 120
d) 80 ≤ 𝑏1 ≤ 10

49. From Q#48 , If the first constraint is changed to 90, then which of the following
is not true
9
 a) 𝑧 = 170 b) 𝑥1 = 10 c) 𝑥2 = 70 d) 𝑎𝑙𝑙
50. From Q#48, suppose the profit on x1 is increased to $4. Is the above solution still
optimal? What is the value of the objective function?
a) Yes & 𝑧 = 180
b) No & 𝑧 = 180
c) Yes & 𝑧 = 200
d) Yes & 𝑧 = 190
51. What is the shadow price of the first constraint is
a) 1 b) -1 c) 0 d) none
52. Write only the optimal solution of the dual problem.
a) (𝑦1 , 𝑦2 , 𝑦3 ) = (1, 1, 0)
b) (𝑦1 , 𝑦2 , 𝑦3 ) = (0,1,1).
c) (𝑦1 , 𝑦2 , 𝑦) = (1,0,1)
d) None
53. To find initial feasible solution of a transportation problem the method which starts
allocation from the lowest cost is called method.
a) north west corner
b) least cost
c) south east corner
d) Vogel’s approximation
54. In a transportation problem, the method of penalties is called method.
a) least cost
b) south east corner
c) Vogel’s approximation
d) north west corner
55. Which of the following statements about the northwest corner rule is false?
a) One must exhaust the supply for each row before moving down to the next
row
b) One must exhaust the demand requirements of each column before moving to
the next column
c) When moving to a new row or column, one must select the cell with the
lowest cost
d) One must check that all supply and demand constraints are met
e) All of the above
56. When the total of allocations of a transportation problem match with supply and
demand values, the solution is called solution.
a) non-degenerate
b) degenerate
c) feasible
d) Infeasible

57. When the allocations of a transportation problem satisfy the rim condition (𝑚 +
𝑛 – 1) the solution is called__________________ solution.
a) degenerate
10
 b) infeasible
c) unbounded
d) non-degenerate
58. When there is a degeneracy in the transportation problem, we add an imaginary
allocation called in the solution.
a) dummy
b) penalty
c) epsilon
d) regret
59. If 𝑚 + 𝑛 – 1 = Number of allocations in transportation, it means . (Where ‘𝑚’ is
number of rows and ‘𝑛’ is number of columns)
a) There is no degeneracy
b) Problem is unbalanced
c) Problem is degenerate
d) Solution is optimal
60. In a transportation with 4-supply points and 5 demand points, how many number
of constraints are required in its formulation
a) 20 b) 1 c) 0 d) 9
61. In a transportation with 4-supply points and 5 demand points, how many number
of variables are required in its formulation
a) 20 b) 1 c) 0 d) 9

62. Which of the following considers difference between two least costs for each row
and column while finding initial basic feasible solution in transportation?
a) North west corner rule
b) Least cost method
c) Vogel’s approximation method
d) Row minima method
63. The solution to a transportation problem with m-sources and n-destinations is
feasible if the numbers of allocations are ___________.
a) m+n b) mn c) m-n d) m+n-1

64. When the total demand is equal to supply then the transportation problem is said
to be_________
a) balanced
b) unbalanced
c) Maximization
d) Minimization
65. When the total demand is not equal to supply then it is said to be __________.
a) balanced
b) unbalanced
c) Maximization
d) Minimization

66. The allocation cells in the transportation table will be called ____________ cell
a) occupied
b) unoccupied
11
 c) No
d) finite
67. In the transportation table, empty cells will be called ___________.
a) occupied
b) unoccupied
c) Basic
d) non-basic
68. In a transportation table, an ordered set of___________or more cells is said to
form a loop
a) 2 b) 3 c) 4 d) 5

69. To resolve degeneracy at the initial solution, a very small quantity is allocated in
____________ cell
a) occupied
b) basic
c) non-basic
d) unoccupied
70. For finding an optimum solution in transportation problem ____________ method
is used.
a) MODI
b) Hungarian
c) Graphical
d) Simplex
71. The similarity between assignment problem and transportation problem is
______________.
a) both are rectangular matrices
b) both are square matrices
c) both can be solved by graphical method
d) both have objective function and non-negativity constraints

72. Consider the following transportation tableau, then the initial basic feasible
solution using NWC is

Supply
6 1 9 3 70
11 5 2 8 55
10 12 4 7 90
Demand 85 35 50 45

a) x12 =35 , x14 = 35, x21 = 5, x23 = 50, x31 = 80, x34 = 10
b) x11 =70 , x21 = 15, x22 =35, x23 = 5, x33 = 45, x34 = 45
c) x12 =35 , x14 = 35, x21 = 5, x23 = 50, x31 =80, x34 = 10
d) None of the above
12
73. What is the minimum initial cost of a transportation problem in Q#72.
a) 1155 b) 1165 c) 1265 d) none
74. The initial basic feasible solution of the transportation tableau in Q#72 using
Vogle’s approximation method is
a) x12 =35 , x14 = 35, x21 = 5, x23 = 50, x31 = 80, x34 = 10
b) x11 =70 , x21 = 15, x22 =35, x23 = 5, x33 = 45, x34 = 45
c) x12 =35 , x14 = 35, x21 = 5, x23 = 50, x31 =80, x34 = 10
d) None of the above
75. What is the minimum initial cost of a transportation problem in Q#74.
a) 1155 b) 1165 c) 1265 d) none
76. The initial basic feasible solution of the transportation tableau in Q#72 using
Minimum-Cost Method is
a) x12 =35 , x14 = 35, x21 = 5, x23 = 50, x31 = 80, x34 = 10
b) x11 =70 , x21 = 15, x22 =35, x23 = 5, x33 = 45, x34 = 45
c) x12 =35 , x14 = 35, x21 = 5, x23 = 50, x31 =80, x34 = 10
d) None of the above
77. What is the minimum initial cost of a transportation problem in Q#76.
a) 1155 b) 1165 c) 1265 d) none
78. Zero sum game has to be a _____________ game
a) Single player
b) Two player
c) Multiplayer
d) Three player
79. Given the following simple game.

Player B

I II III IV
Player
I -2 0 0 5
A
II 4 2 1 3
III -4 -3 0 -2
IV 5 3 -4 2
What is the value of the game?
a) 1 b) 0 c) 3 d) 2
80. The optimal strategies for both players in game of Q#79 is
a) Player A must select II strategy and player B the I strategy
b) Player A must select I strategy and player B the II strategy
c) Player A must select II strategy and player B the III strategy
d) Player A must select III strategy and player B the II strategy

13