A1. In the graphical method for solving linear programming problems, the number of constraints
(___________________) and the bounded region combining all the allowed constraints is
known as (___________________).
A. (is restricted to not more than 2 constraints) ; (solution region)
B. (is not restricted to any number of constraints) ; (optimal region)
C. (is restricted to not more than 2 constraints) ; (feasible solution region)
D. (is not restricted to any number of constraints) ; (solution region)
E. (is restricted to not more than 2 constraints) ; (basic solution region)
F. (is not restricted to any number of constraints) ; (basic solution region)
G. (is not restricted to any number of constraints) ; (feasible solution region)
H. (is restricted to not more than 2 constraints) ; (optimal region)
I. (is restricted to not more than 2 constraints) ; (feasible solution region)
J. (is not restricted to any number of constraints) ; (optimal region)
Question A2. If the primal linear programming problem is a maximization problem, the ‘optimal value of
dual variable 𝑦𝑖
’ is read in Row “0” emanating from the objective function in the optimal
tableau where 𝑦𝑖 = ___________________.
A. The coefficient of slacki if constraint i is a <= constraint); the –‘coefficient of surplusi if constraint
i is a >= constraint); and/or the coefficient of artificial variable +M if constraint i is a = constraint
B. The coefficient of slacki if constraint i is a >= constraint); the –‘coefficient of surplusi if constraint
i is a >= constraint); and/or the coefficient of artificial variable –M if constraint i is a = constraint
C. The coefficient of slacki if constraint i is a <= constraint); the –‘coefficient of surplusi if constraint
i is a >= constraint); and/or the coefficient of artificial variable –M if constraint i is a = constraint
D. The coefficient of slacki if constraint i is a < constraint); the –‘coefficient of surplusi if constraint
i is a >= constraint); and/or the coefficient of artificial variable –M if constraint i is a = constraint
E. None of the Above
F. Uncertain
Question A3. When solving transportation problems, one disadvantage of using North-West Corner rule to
find initial solution is that (___________________); while the method of finding an initial
solution based upon opportunity costs is called (___________________).
A. (it leads to a degenerate initial solution) ; (Vogel’s approximation)
B. (it is complicated to use) ; (the northwest corner rule)
C. (it does not take into account transportation cost) ; (the northwest corner rule)
D. (it does not take into account transportation cost) ; (Vogel’s approximation)
E. (it leads to a degenerate initial solution) ; (Hungarian method)
F. (it is complicated to use) ; (Vogel’s approximation)
G. (it does not take into account transportation cost) ; (Hungarian method)
H. All of the above
I. None of the Above
J. Uncertain
Page 2 of 12
Answers:
A1. C. (is restricted to not more than 2 constraints) ; (feasible solution region)
A2. A. The coefficient of slack𝑖 if constraint 𝑖 is a <= constraint); the coefficient of surplus𝑖 if constraint 𝑖 is a >= constraint); and/or the coefficient of artificial variable +𝑀 if constraint 𝑖 is a = constraint
A3. A. (it leads to a degenerate initial solution) ; (Vogel’s approximation)