# Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively: Maximize

## Question:

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.

Fantastic news! We've Found the answer you've been seeking!

## Step by Step Answer:

**Related Book For**

## Introduction to Operations Research

**ISBN:** 978-1259162985

10th edition

**Authors:** Frederick S. Hillier, Gerald J. Lieberman