Q: How difficult is it to expand the original RedBrand model? Answer
How difficult is it to expand the original RedBrand model? Answer this by adding a new plant, two new warehouses, and three new customers, and modify the spreadsheet model appropriately. You can make...
See AnswerQ: In the RedBrand problem with shrinkage, change the assumptions. Now
In the RedBrand problem with shrinkage, change the assumptions. Now instead of assuming that there is some shrinkage at the warehouses, assume that there is shrinkage in delivery along each route. Spe...
See AnswerQ: Consider a modification of the original RedBrand problem where there are N
Consider a modification of the original RedBrand 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...
See AnswerQ: Continuing the previous problem, develop and optimize a sample model with
Continuing the previous problem, develop and optimize 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 he...
See AnswerQ: Suppose in the original Grand Prix example that the routes from plant
Suppose in the original Grand Prix example that the routes from plant 2 to region 1 and from plant 3 to region 3 are not allowed. (Perhaps there are no railroad lines for these routes.) How would you...
See AnswerQ: In Maude’s shortest path problem, suppose all arcs in the network
In Maude’s shortest path problem, suppose all arcs in the network are double-arrowed, that is, Maude can travel along each arc (with the same distance) in either direction. Modify the spreadsheet mode...
See AnswerQ: In Maude’s shortest path problem, suppose all arcs in the current
In Maude’s shortest path problem, suppose all arcs in the current network from higher-numbered nodes to lower numbered nodes, such as from node 6 to node 5, are disallowed. Modify the spreadsheet mode...
See AnswerQ: Continuing the previous problem, suppose again that all arcs go in
Continuing the previous problem, suppose again that all arcs go in both directions, but suppose Maude’s objective is to find the shortest path from node 1 to node 7 (not node 10). Modify the spreadshe...
See AnswerQ: The file lists sales (in millions of dollars) of Dell
The file lists sales (in millions of dollars) of Dell Computer during the period 1987–1997 (where year 1 corresponds to 1987). a. Fit a power and an exponential trend curve to these data. Which fits t...
See AnswerQ: In the VanBuren machine replacement problem, we assumed that the maintenance
In the VanBuren machine replacement problem, we assumed that the maintenance cost and salvage values are linear functions of age. Suppose instead that the maintenance cost increases by 50% each quarte...
See Answer
