# Question

Label each of the following statements as True or False, and then justify your answer by referring to specific statements in the chapter:

(a) Linear programming problems are generally considerably easier to solve than IP problems.

(b) For IP problems, the number of integer variables is generally more important in determining the computational difficulty than is the number of functional constraints.

(a) Linear programming problems are generally considerably easier to solve than IP problems.

(b) For IP problems, the number of integer variables is generally more important in determining the computational difficulty than is the number of functional constraints.

## Answer to relevant Questions

Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively: Maximize Z = 2x1 – x2 + 5x3 – 3x4 + 4x5, Subject to and xj is binary, for j = 1, 2, . . . , 5. Consider the following statements about any pure IP problem (in maximization form) and its LP relaxation. Label each of the statements as True or False, and then justify your answer: (a) The feasible region for the LP ...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 ...Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively: Minimize Z = 5x1 + x2 + x3 + 2x4 + 3x5, Subject to and xj ≥ 0, for j = 1, 2, 3, 4, 5 xj is integer, for j = 1, ...Apply the procedure for tightening constraints to each of the following constraints for a pure BIP problem: (a) x1 + 3x2 – 4x3 ≤ 2. (b) 3x1 – x2 + 4x3 ≥ 1.Post your question

0