BIT 2406

Chapter 7 Problems and Answers

The problems referenced are from Introduction to Management Science, by B. W. Taylor III, 11e.
Work the following problems from Chapter 7.
1. Solve the three LP models formulated in class from Chapter 7 (ACA, Coal Bank Hollow Recycling, and
the Max Flow problem) using MS Excel. Note that weve already formulated the models for these
problems.
2. Draw the network representation of the following network flow problem. What kind of network flow
problem is this?
Min Z = 2X13 + 6X14 + 5X15 + 4X23 + 3X24 + 7X25
subject to
-X13 X14 X15 = -8
-X23 X24 X25 = -7
X13 + X23 = +5
X14 + X24 = +5
X15 + X25 = +5
Xij 0 for all i and j
This is a transportation network.
3. Problem 9
Shortest route path = 1761012

4. Problem 26
Minimal spanning tree distance = 41
5. Problem 35
Maximal flow = 12