Question

D,I 12.6-1.* Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively. \[ \text { Maximize } \quad Z=2 x_{1}-x_{2}+5 x_{3}-3 x_{4}+4 x_{5} \] subject to \[ \begin{array}{r} 3 x_{1}-2 x_{2}+7 x_{3}-5 x_{4}+4 x_{5} \leq 6 \\ x_{1}-x_{2}+2 x_{3}-4 x_{4}+2 x_{5} \leq 0 \end{array} \] and \[ x_{j} \text { is binary, } \quad \text { for } j=1,2, \ldots, 5 . \] D.I 12.6-2. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively. \[ \text { Minimize } \quad Z=5 x_{1}+6 x_{2}+7 x_{3}+8 x_{4}+9 x_{5} \] subject to \[ \begin{aligned} 3 x_{1}-x_{2}+x_{3}+x_{4}-2 x_{5} & \geq 2 \\ x_{1}+3 x_{2}-x_{3}-2 x_{4}+x_{5} & \geq 0 \\ -x_{1}-x_{2}+3 x_{3}+x_{4}+x_{5} & \geq 1 \end{aligned} \] and \( x_{j} \) is binary, \( \quad \) for \( j=1,2, \ldots, 5 \). D,I 12.6-3. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively. \[ \text { Maximize } \quad Z=5 x_{1}+5 x_{2}+8 x_{3}-2 x_{4}-4 x_{5}, \] subject to \[ \begin{aligned} -3 x_{1}+6 x_{2}-7 x_{3}+9 x_{4}+9 x_{5} & \geq 10 \\ x_{1}+2 x_{2}-x_{4}-3 x_{5} & \leq 0 \end{aligned} \] and \( x_{j} \) is binary, \( \quad \) for \( j=1,2, \ldots, 5 \). D,I 12.6-4. Reconsider Prob. 12.3-6(a). Use the BIP branch-andbound algorithm presented in Sec. 12.6 to solve this BIP model interactively. D,I 12.6-5. Reconsider Prob. 12.4-10(a). Use the BIP algorithm presented in Sec. 12.6 to solve this problem interactively.

          D,I 12.6-1.* Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.
\[
\text { Maximize } \quad Z=2 x_{1}-x_{2}+5 x_{3}-3 x_{4}+4 x_{5}
\]
subject to
\[
\begin{array}{r}
3 x_{1}-2 x_{2}+7 x_{3}-5 x_{4}+4 x_{5} \leq 6 \\
x_{1}-x_{2}+2 x_{3}-4 x_{4}+2 x_{5} \leq 0
\end{array}
\]
and
\[
x_{j} \text { is binary, } \quad \text { for } j=1,2, \ldots, 5 .
\]
D.I 12.6-2. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.
\[
\text { Minimize } \quad Z=5 x_{1}+6 x_{2}+7 x_{3}+8 x_{4}+9 x_{5}
\]
subject to
\[
\begin{aligned}
3 x_{1}-x_{2}+x_{3}+x_{4}-2 x_{5} & \geq 2 \\
x_{1}+3 x_{2}-x_{3}-2 x_{4}+x_{5} & \geq 0 \\
-x_{1}-x_{2}+3 x_{3}+x_{4}+x_{5} & \geq 1
\end{aligned}
\]
and
\( x_{j} \) is binary, \( \quad \) for \( j=1,2, \ldots, 5 \).
D,I 12.6-3. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.
\[
\text { Maximize } \quad Z=5 x_{1}+5 x_{2}+8 x_{3}-2 x_{4}-4 x_{5},
\]
subject to
\[
\begin{aligned}
-3 x_{1}+6 x_{2}-7 x_{3}+9 x_{4}+9 x_{5} & \geq 10 \\
x_{1}+2 x_{2}-x_{4}-3 x_{5} & \leq 0
\end{aligned}
\]
and
\( x_{j} \) is binary, \( \quad \) for \( j=1,2, \ldots, 5 \).
D,I 12.6-4. Reconsider Prob. 12.3-6(a). Use the BIP branch-andbound algorithm presented in Sec. 12.6 to solve this BIP model interactively.

D,I 12.6-5. Reconsider Prob. 12.4-10(a). Use the BIP algorithm presented in Sec. 12.6 to solve this problem interactively.

D,I 12.6-1.* Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.

Maximize Z=2 x1-x2+5 x3-3 x4+4 x5

subject to

3 x1-2 x2+7 x3-5 x4+4 x5≤ 6

x1-x2+2 x3-4 x4+2 x5≤ 0

and

xj is binary, for j=1,2, …, 5 .

D.I 12.6-2. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.

Minimize Z=5 x1+6 x2+7 x3+8 x4+9 x5

subject to

3 x1-x2+x3+x4-2 x5 ≥ 2

x1+3 x2-x3-2 x4+x5 ≥ 0

-x1-x2+3 x3+x4+x5 ≥ 1

and
xj is binary, for j=1,2, …, 5.
D,I 12.6-3. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.

Maximize Z=5 x1+5 x2+8 x3-2 x4-4 x5,

subject to

-3 x1+6 x2-7 x3+9 x4+9 x5 ≥ 10

x1+2 x2-x4-3 x5 ≤ 0

and
xj is binary, for j=1,2, …, 5.
D,I 12.6-4. Reconsider Prob. 12.3-6(a). Use the BIP branch-andbound algorithm presented in Sec. 12.6 to solve this BIP model interactively.

D,I 12.6-5. Reconsider Prob. 12.4-10(a). Use the BIP algorithm presented in Sec. 12.6 to solve this problem interactively.

Added by Stephen C.

Question

Please give Ace some feedback