16) In order for a linear programming problem to have multiple solutions, the solution
must exist
A) at the intersection of the non-negativity constraints.
B) on a non-redundant constraint parallel to the objective function.
C) at the intersection of the objective function and a constraint.
D) at the intersection of three or more constraints.
E) None of the above
17) Andre Candess manages an office supply store. One product in the store is
computer paper. Andre knows that 10,000 boxes will be sold this year at a constant rate
throughout the year. There are 250 working days per year and the lead-time is 3 days.
The cost of placing an order is $30, while the holding cost is $15 per box per year. If
Andre orders 500 boxes each time he orders from his supplier, what would his total
annual inventory cost be (holding cost plus ordering cost)?
A) $3,000
B) $4,350
C) $3,075
D) $3,750
E) None of the above
18) Table 14-2
The following data consists of a matrix of transition probabilities (P) of three competing
retailers, the initial market share (0). Assume that each state represents a retailer
(Retailer 1, Retailer 2, Retailer 3, respectively) and the transition probabilities represent
changes from one month to the next.
Using the data given in Table 14-2, find the market shares for the three retailers in
month 2.
A) (2) = (0.30, 0.60, 0.10)
B) (2) = (0.55, 0.33, 0.12)
C) (2) = (0.44, 0.43, 0.12)
D) (2) = (0.55, 0.12, 0.33)
E) (2) = (0.47, 0.40, 0.13)