# Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively: Maximize Z

## Question:

Maximize Z = 2x1 €“ x2 + 5x3 €“ 3x4 + 4x5,

Subject to

and

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

Fantastic news! We've located 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