9781118041581

736 Chapter 17 Linear Programming

TABLE 17.2

Linear Programming

Solution for Busing

Problem

The least-cost solution

shows the numbers

of children bused on

six routes between

neighborhoods and

schools.

Set Target Cell:

Solver Parameters?

$G$4

$B$12 : $E$14

Equal to:

By Changing Cells:

Subject to Constraints:

Add

Change

Delete

Solve

Close

Options

Max Min

$H$12 : $H$14 ≥ 0

$B$18 : $E$18 = 0

$B$12 : $E$14 ≥ 0

ABCDEFGHI

1

2 Distances Total

3 North East West South Kid-Miles

4 School 1 2.0 3.0 1.4 3.2 1,792

5 School 2 3.2 2.4 2.0 2.0

6 School 3 3.6 1.4 3.0 2.2

7

8

9 Students Total in Capacity Extra Shadow

10 North East West South School of School Spaces Prices

11

12 School 1 240 0 120 0 360 360 0 0.8

13 School 2 0 0 280 120 400 400 0 0.2

14 School 3 0 120 0 80 200 260 60 0

15

16 Total Kids Bused 240 120 400 200

17 Students in District 240 120 400 200

18 Difference 0 0 0 0

19 Shadow Prices 2.8 1.4 2.2 2.2

20

c17LinearProgramming.qxd 9/26/11 11:05 AM Page 736