# Question: The board of directors of General Wheels Co is considering

The board of directors of General Wheels Co. is considering six large capital investments. Each investment can be made only once. These investments differ in the estimated long-run profit (net present value) that they will generate as well as in the amount of capital required, as shown by the following table (in units of millions of dollars):

The total amount of capital available for these investments is $100 million. Investment opportunities 1 and 2 are mutually exclusive, and so are 3 and 4. Furthermore, neither 3 nor 4 can be undertaken unless one of the first two opportunities is undertaken. There are no such restrictions on investment opportunities 5 and 6. The objective is to select the combination of capital investments that will maximize the total estimated long-run profit (net present value).

(a) Formulate a BIP model for this problem.

(b) Use the computer to solve this model.

The total amount of capital available for these investments is $100 million. Investment opportunities 1 and 2 are mutually exclusive, and so are 3 and 4. Furthermore, neither 3 nor 4 can be undertaken unless one of the first two opportunities is undertaken. There are no such restrictions on investment opportunities 5 and 6. The objective is to select the combination of capital investments that will maximize the total estimated long-run profit (net present value).

(a) Formulate a BIP model for this problem.

(b) Use the computer to solve this model.

## Answer to relevant Questions

Follow the instructions of Prob. 12.7-2 for the following IP model: Minimize Z = 2x1 + 3x2, Subject to And x1 ≥ 0, x2 ≥ 0 x1, x2 are integer. (a) Solve this problem graphically. (b) Use the MIP branch-and-bound algorithm ...Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively: Maximize Z = 5x1 + 4x2 + 4x3 + 2x4, Subject to and xj ≥ 0, for j = 1, 2, 3, 4 xj is integer for j = 1, 2, 3. For each of the following constraints of pure BIP problems, identify which ones are made redundant by the binary constraints. Explain why each one is, or is not, redundant. (a) 2x1 + x2 + 2x3 ≤ 5 (b) 3x1 – 4x2 + 5x3 ≤ ...Generate as many cutting planes as possible from the following constraint for a pure BIP problem. 5x1 + 3x2 + 7x3 + 4x4 + 6x5 ≤ 9. Problem 11.3-2 describes how the owner of a chain of three grocery stores needs to determine how many crates of fresh strawberries should be allocated to each of the stores. Formulate a compact constraint programming model ...Post your question