1. (30 pts) Problems (a-h): True False problem. Problems (i-j): Filling blank problems. a. (T, F) An LP problem with unbounded feasible area can have a (bounded) optimal solution.

b. (T, F) In a balanced transportations problem, the total supply quantity is larger than the total demand quantity.

c. (T, F) If we have a tie at the minimum ratio test of Simplex Method, we always have a degeneracy at the next iteration.

d. (T, F) In an M/M/2//5/6, we can have three waiting people in the line at maximum.

e. (T, F) In a queueing system, in general, if the variance of the inter arrival time increases, the waiting time increases; however, if the variance of the service time increases, the waiting time decreases

. f. (T, F) It is possible that, when we change the coefficients of the decision variables of the objective function, the optimal solution stays at the same optimal point.

g. (T, F) If we have a zero value for the reduced cost (c-bar) of a slack variable in an optimal LP table, the problem does not have a feasible solution

. h. (T, F) In the inventory management theory, the EOQ model uses the unit holding cost ($) per unit item per year. If the holding cost is expressed by percentage (e.g., 10% per year), the unit holding cost is calculated by percentage multiplied by the unit purchasing price of a product.

i. In a queueing system, when a customer cannot enter the system because the system is full, we call it ___________.

j. The ____________________ for the i-th constraint of an LP is the amount by which the optimal z-value is improved if the right-hand side of the i-th constraint is increased by 1 (while keeping the same basis).