# Question: Consider a modification of the original Red Brand problem where

Consider a modification of the original Red Brand problem where there are N plants, M warehouses, and L customers. Assume that the only allowable arcs are from plants to warehouses and from warehouses to customers. If all such arcs are allowable—all plants can ship to all warehouses and all warehouses can ship to all customers—how many changing cells are in the spreadsheet model? Keeping in mind that Excel’s Solver can handle at most 200 changing cells, provide some combinations of N, M, and L that barely stay within Solver’s limit.

**View Solution:**## Answer to relevant Questions

Continuing the previous problem, develop a sample model with your own choices of N, M, and L that barely stay within Solver’s limit. You can make up any input data. The important point here is the layout and formulas of ...In the current no-backlogging problem, SureStep doesn’t hire any workers, and it uses almost no overtime. This is evidently because of low demand. Change the demands to 6000, 8000, 5000, and 3000, and rerun Solver. Is ...In the pension fund problem, suppose there is a fourth bond, bond 4. Its unit cost in 2010 is $1020; it returns coupons of $70 in years 2011 through 2016 and a payment of $1070 in 2017. Modify the model to incorporate this ...In the capital budgeting model in Figure 14.40, we supplied the NPV for each investment. Suppose instead that you are given only the streams of cash inflows from each investment shown in the file S14_49.xlsx. This file also ...In the Great Threads model, the production quantities in row 16 were not constrained to be integers. Presumably, any fractional values could be safely rounded to integers. See whether this is true. Constrain these quantities ...Post your question