Вы находитесь на странице: 1из 72

# Microsoft Excel 14.

Worksheet: [New____Examples.xlsx]Knapsack
Report Created: 9/6/2011 8:33:34 AM
Result: Solver found an integer solution within tolerance. All Constraints are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 Seconds.
Iterations: 0 Subproblems: 14
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Max)

Cell Name Original Value Final Value

Total
Calories
\$E\$9 (Maximize) 3600 3700

Variable Cells
Cell Name Original Value Final Value Integer

Candy Bar
Number of
\$C\$4 Objects 10 5 Integer

Sandwich
Number of
\$C\$5 Objects 10 25 Integer

Juice Can
Number of
\$C\$6 Objects 10 0 Integer

Apple
Number of
\$C\$7 Objects 10 0 Integer

Constraints
Cell Name Cell Value Formula Status Slack

Total
Protein
\$G\$9 (g) 1025 \$G\$9>=\$B\$19 Not Binding 825
Total
Weight
\$I\$9 (kg) 10 \$I\$9<=\$B\$15 Binding 0

Total
Volume
\$K\$9 (m3) 0.0525 \$K\$9<=\$B\$17 Not Binding 0.0725
\$C\$4=Integer
\$C\$5=Integer
\$C\$6=Integer
\$C\$7=Integer
Number of
Object Calories Protein (grams) Weight of Object (kg)
Objects
Per Per Per
Object Total Object Total Object Total
Candy Bar 5 90 450 5 25 0.25 1.25
Sandwich 25 130 3250 40 1000 0.35 8.75
Juice Can 0 100 0 15 0 0.35 0
Apple 0 40 0 3 0 0.3 0
Decision
Variables
Total Total Total
Calories Protein Weight
(Maximize) (g) (kg)
Column
Totals 3700 1025 10
Objective Constraint Constraint

Constraints

## Integer All 4 Decision Variables (green cells)

(Number of Candy Bars)
(Number of Sandwiches)
(Number of Juice Cans)
(Number of Apples)

## Protein Weight Volume

Calories
Object Per (grams) (kg) (m3)
Per Per Per
Object Object Object Object

## Candy Bar 90 5 0.25 0.0005

Sandwich 130 40 0.35 0.002
Juice Can 100 15 0.35 0.00075
Apple 40 3 0.3 0.0009
Volume of Object (m3)

Per
Object Total
0.0005 0.003
0.002 0.050
0.00075 0.000
0.0009 0.000

Total
Volume
(m3)

0.0525
Constraint
Worksheet: [New____Examples.xlsx]Product Mix
Report Created: 9/6/2011 8:51:46 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0 Seconds.
Iterations: 3 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Max)

Cell Name Original Value Final Value

Total
Profit
\$E\$7 (Maximize) \$508 \$1,083

Variable Cells
Cell Name Original Value Final Value Integer

Finished
Product 1
Number
\$C\$3 Built 10 58 Integer

Finished
Product 2
Number
\$C\$4 Built 10 0 Integer

Finished
Product 3
Number
\$C\$5 Built 10 26 Integer

Constraints
Cell Name Cell Value Formula Status Slack

Total Number
of Part 1
\$E\$17 Used 194 \$E\$17<=\$B\$20 Not Binding 806
Total Number
of Part 2
\$G\$17 Used 600 \$G\$17<=\$B\$22 Binding 0

Total Number
of Part 3
\$I\$17 Used 550 \$I\$17<=\$B\$24 Binding 0
\$C\$3=Integer
\$C\$4=Integer
\$C\$5=Integer
Number Profit Per Total
Built Unit Built Profit
Finished Product 1 58 \$10.00 \$580
Finished Product 2 0 \$21.40 \$0
Finished Product 3 26 \$19.35 \$503
Decision
Variables
Total
Profit
(Maximize)
\$1,083
Objective

Constraints

## # of Part 1 Total # of Part # of Part 2

Required Per 1 Required Per
Number Unit of Required Unit of
Built Finished Finished
Product Product

## Finished Product 1 58 2 116 9

Finished Product 2 0 4 0 6
Finished Product 3 26 3 78 3

Total Number
of Part 1
Used
194
Constraint

Constraints
1000 = Total Number of Part 1 Available

## Integer All 3 Decision Variables (green cells)

(Number of Finished Product 1)
(Number of Finished Product 2)
(Number of Finished Product 3)

## - Finished Product 1, Finished Product 2, and Finished Product 3

all are built from the same parts (Part 1, Part 2, and Part 3)

- Given the different profit levels for each of the 3 Finished Products,
the different number of each Part required in each Finished Product,
and the number of each Part available, Determine how many of each
Finished Product should be created to maximize profit.
Total # of Part # of Part 3 Total # of Part
2 Required 3
Required Per Unit of Required
Finished
Product

522 5 290
0 11 0
78 10 260

## Total Number Total Number

of Part 2 of Part 3
Used Used
600 550
Constraint Constraint
Worksheet: [New____Examples.xlsx]Cutting Stock
Report Created: 9/6/2011 9:33:19 AM
Result: Solver found an integer solution within tolerance. All Constraints are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 2 Subproblems: 10
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Min)

Cell Name Original Value Final Value

Total
Waste
\$I\$16 (Minimize) 550 180

Variable Cells
Cell Name Original Value Final Value Integer
\$H\$4 75" Combo 1 Number Cut 10 0 Integer
\$H\$5 75" Combo 2 Number Cut 10 1 Integer
\$H\$6 75" Combo 3 Number Cut 10 39 Integer
\$H\$7 75" Combo 4 Number Cut 10 49 Integer
\$H\$8 75" Combo 5 Number Cut 10 0 Integer
\$H\$9 75" Combo 6 Number Cut 10 0 Integer
\$H\$10 75" Combo 7 Number Cut 10 0 Integer
\$H\$11 55" Combo 8 Number Cut 10 0 Integer
\$H\$12 55" Combo 9 Number Cut 10 1 Integer
\$H\$13 55" Combo 10 Number Cut 10 0 Integer
\$H\$14 55" Combo 11 Number Cut 10 58 Integer

Constraints
Cell Name Cell Value Formula Status Slack

Total Number of
13" Rolls
\$I\$36 Cut 350 \$I\$36=\$C\$43 Binding 0
Total Number of
25" Rolls
\$H\$36 Cut 150 \$H\$36=\$C\$41 Binding 0
Total Number of
36" Rolls
\$G\$36 Cut 40 \$G\$36=\$C\$39 Binding 0
\$H\$7=Integer
\$H\$11=Integer
\$H\$6=Integer
\$H\$8=Integer
\$H\$9=Integer
\$H\$14=Integer
\$H\$5=Integer
\$H\$4=Integer
\$H\$13=Integer
\$H\$12=Integer
\$H\$10=Integer
Garment
Number of Final Cut Rolls Garment Leftover
Cutting Of Each Width Used When When
Combination Per Combination After Cutting Cutting This Cutting This
Number Combo Combo
36" 25" 13"
75" Combo 1 2 0 0 72 3
75" Combo 2 1 1 1 74 1
75" Combo 3 1 0 3 75 0
75" Combo 4 0 3 0 75 0
75" Combo 5 0 2 1 63 12
75" Combo 6 0 1 3 64 11
75" Combo 7 0 0 5 65 10
55" Combo 8 1 0 1 49 6
55" Combo 9 0 2 0 50 5
55" Combo 10 0 1 2 51 4
55" Combo 11 0 0 4 52 3

## Constraints (This Is Copied From Above)

Number of
Number of Final Cut Rolls Initial Rolls
Of Each Width Cut With Total Number of Final Cut R
Per Combination After Cutting This Combo Of Each Width After Cutti

## 36" 25" 13" 36"

2 0 0 0 0
1 1 1 1 1
1 0 3 39 39
0 3 0 49 0
0 2 1 0 0
0 1 3 0 0
0 0 5 0 0
1 0 1 0 0
0 2 0 1 0
0 1 2 0 0
0 0 4 58 0

Total
Number of
36" Rolls
Cut
Column Totals 40
Constraint

Constraints
40 = Total Number of 36" Rolls Ordered (Equals Number of 36" R

## Integer All 11 Decision Variables (green cells)

(Number of Initial Rolls Cut with Each Combo)

## Nonnegative All Unconstrained Variables

Total
Waste From
All Rolls
Cut
With
Number Cut This Combo

0 0
1 1
39 0
49 0
0 0
0 0
0 0
0 0
1 5
0 0
58 174
Decision
Variables
Total
Waste
(Minimize)
180
Objective

## Total Number of Final Cut Rolls

Of Each Width After Cutting

25" 13"
0 0
1 1
0 117
147 0
0 0
0 0
0 0
0 0
2 0
0 0
0 232

Total Total
Number of Number of
25" Rolls 13" Rolls
Cut Cut
150 350
Constraint Constraint

## ered (Equals Number of 13" Rolls Cut)

th Each Combo)
Worksheet: [New____Examples.xlsx]Machine Selection
Report Created: 9/6/2011 9:48:15 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 7 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Min)

Cell Name Original Value Final Value

Total
Cost
\$H\$16 (Minimize) \$11 \$1,730

Variable Cells
Cell Name Original Value Final Value Integer

Machine 1 1"
Bolts
\$C\$12 Cut 10 0 Integer

Machine 2 1"
Bolts
\$C\$13 Cut 10 3500 Integer

Machine 3 1"
Bolts
\$C\$14 Cut 10 12500 Integer

Machine 1 2"
Bolts
\$D\$12 Cut 10 2000 Integer

Machine 2 2"
Bolts
\$D\$13 Cut 10 1000 Integer

Machine 1 3"
Bolts
\$E\$12 Cut 10 400 Integer

Constraints
Cell Name Cell Value Formula Status Slack
Total
Number
1" Bolts
\$C\$28 In Order 16000 \$C\$28>=\$B\$32 Binding 0

Total
Number
2" Bolts
\$D\$28 In Order 3000 \$D\$28>=\$B\$34 Binding 0

Total
Number
3" Bolts
\$E\$28 In Order 400 \$E\$28>=\$B\$36 Binding 0

Machine 1
Total
Minutes
Per
\$H\$24 Machine 480 \$H\$24<=\$B\$39 Not Binding 20

Machine 2
Total
Minutes
Per
\$H\$25 Machine 500 \$H\$25<=\$B\$39 Binding 0

Machine 3
Total
Minutes
Per
\$H\$26 Machine 500 \$H\$26<=\$B\$39 Binding 0
\$C\$12=Integer
\$C\$13=Integer
\$C\$14=Integer
\$D\$12=Integer
\$D\$13=Integer
\$E\$12=Integer
Operating
Speed Cost Per Levels of Capability
Output Unit

Operating
Cost
Number of per 100 Ability Ability Ability
Bolts Per Bolts To Make To Make To Make
Minute Produced 1" Bolts 2" Bolts 3" Bolts
Machine 1 5 \$25 1 1 1
Machine 2 9 \$14 1 1 0
Machine 3 25 \$4 1 0 0

Bolts Produced
(Decision Variables) Number Cost Per
of Bolts 100 Bolts
1" Bolts 2" Bolts 3" Bolts Per Per Total Cost
Cut Cut Cut Machine Machine Per Machine
Machine 1 0 2000 400 2400 \$25 \$600
Machine 2 3500 1000 4500 \$14 \$630
Machine 3 12500 12500 \$4 \$500

Total
Cost
(Minimize)
\$1,730
Objective

Constraints

Bolts Produced
Number Number Total
of Bolts of Minutes
Per Bolts Per Per
1" 2" 3" Machine Minute Machine
Machine 1 0 2000 400 2400 5 480
Machine 2 3500 1000 4500 9 500
Machine 3 12500 12500 25 500
Constraints

## Total Total Total

Number Number Number
1" Bolts 2" Bolts 3" Bolts
In Order In Order In Order
16000 3000 400
Constraint Constraint Constraint

Constraints

## Integer All 6 Decision Variables (green cells)

(Number of bolts produced per machine)

## Production Machine Selection

- 3 Different machine perform the same generic type of a task.
- Each machine varies in the level that it performs of that task,
its operating cost per unit of output, and its speed at producing
units of output

## - The task is to minimize total cost of each order while meeting

differing requirements

## - The 3 machines produce bolts.

- 1 Unit = 1 Bolt
- The different levels are the different sizes of bolts that each of
3 machines is capable of producing.
Worksheet: [New____Examples.xlsx]Employee Satisfaction
Report Created: 9/6/2011 10:32:36 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 10 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Max)

Cell Name Original Value Final Value

Cumulative
Satisfaction
With Final
Choices
\$G\$30 (Maximize) 11 18

Variable Cells
Cell Name Original Value Final Value Integer
\$C\$14 Salesperson 1 In Territory 1 ? 1 0 Integer
\$C\$15 Salesperson 2 In Territory 1 ? 0 0 Integer
\$C\$16 Salesperson 3 In Territory 1 ? 0 1 Integer
\$C\$17 Salesperson 4 In Territory 1 ? 0 0 Integer
\$D\$14 Salesperson 1 In Territory 2 ? 0 1 Integer
\$D\$15 Salesperson 2 In Territory 2 ? 1 0 Integer
\$D\$16 Salesperson 3 In Territory 2 ? 0 0 Integer
\$D\$17 Salesperson 4 In Territory 2 ? 0 0 Integer
\$E\$14 Salesperson 1 InTerritory 3 ? 0 0 Integer
\$E\$15 Salesperson 2 InTerritory 3 ? 0 1 Integer
\$E\$16 Salesperson 3 InTerritory 3 ? 1 0 Integer
\$E\$17 Salesperson 4 InTerritory 3 ? 0 0 Integer
\$F\$14 Salesperson 1 In Territory 4 ? 0 0 Integer
\$F\$15 Salesperson 2 In Territory 4 ? 0 0 Integer
\$F\$16 Salesperson 3 In Territory 4 ? 0 0 Integer
\$F\$17 Salesperson 4 In Territory 4 ? 1 1 Integer

Constraints
Cell Name Cell Value Formula Status Slack
Total Number
Salespeople
\$C\$19 In Territory 1 1 \$C\$19=\$B\$34 Binding 0

Total Number
Salespeople
\$D\$19 In Territory 2 1 \$D\$19=\$B\$36 Binding 0

Total Number
Salespeople
\$E\$19 In Territory 3 1 \$E\$19=\$B\$38 Binding 0

Total Number
Salespeople
\$F\$19 In Territory 4 1 \$F\$19=\$B\$40 Binding 0

Salesperson 1
Total Number
of Territories
Assigned To This
\$G\$14 Salesperson 1 \$G\$14=\$B\$43 Binding 0

Salesperson 2
Total Number
of Territories
Assigned To This
\$G\$15 Salesperson 1 \$G\$15=\$B\$43 Binding 0

Salesperson 3
Total Number
of Territories
Assigned To This
\$G\$16 Salesperson 1 \$G\$16=\$B\$43 Binding 0

Salesperson 4
Total Number
of Territories
Assigned To This
\$G\$17 Salesperson 1 \$G\$17=\$B\$43 Binding 0
\$C\$14=Integer
\$C\$15=Integer
\$C\$16=Integer
\$C\$17=Integer
\$D\$14=Integer
\$D\$15=Integer
\$D\$16=Integer
\$D\$17=Integer
\$E\$14=Integer
\$E\$15=Integer
\$E\$16=Integer
\$E\$17=Integer
\$F\$14=Integer
\$F\$15=Integer
\$F\$16=Integer
\$F\$17=Integer
Salesperson's Stated Preferrence Rating For Each Territory

## Sales Sales Sales Sales

Territory Territory Territory Territory
1 2 3 4
Salesperson 1 1 3 5 4
Salesperson 2 4 1 5 3
Salesperson 3 5 2 4 3
Salesperson 4 4 1 2 5

## Decision Variables ( Can Only Be Either 1 or 0 )

( Made To Be Binary By Setting Columns Totals To 1 )

## In Territory 1 ? In Territory 2 ? InTerritory 3 ? In Territory 4 ?

Salesperson 1 0 1 0 0
Salesperson 2 0 0 1 0
Salesperson 3 1 0 0 0
Salesperson 4 0 0 0 1

## Total Number Total Number Total Number Total Number

Salespeople Salespeople Salespeople Salespeople
In Territory 1 In Territory 2 In Territory 3 In Territory 4
1 1 1 1
Constraint Constraint Constraint Constraint

## If-Then-Else Cell C23 Contains: =IF(C12=1,C3," ")

All Cells From C23 to G26 Have Similar If-Then-Else Statements

## Sales Sales Sales Sales

Territory 1 Territory 2 Territory 3 Territory 4
Salesperson 1 3
Salesperson 2 5
Salesperson 3 5
Salesperson 4 5

Constraints
1 = Total Number of Salespeople in Territory 1

## Integer All 12 Decision Variables (green cells)

(Satisfaction Survey Scores)

## Nonnegative All Unconstrained Variables

)
o1)

Total Number
of Territories
Assigned To
This
Salesperson
1
1
1
1
Constraints

Satisfaction
With
Final
Choices
3
5
5
5

Cumulative
Satisfaction
With Final
Choices
(Maximize)
18
Objective
Worksheet: [New____Examples.xlsx]Logistics
Report Created: 9/6/2011 10:58:43 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 7 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Min)

Cell Name Original Value Final Value

Total Cost
of Shipping
\$D\$20 (Minimize) \$320 \$910

Variable Cells
Cell Name Original Value Final Value Integer

Factory 1 Number of
Units Shipped
\$C\$13 To Store 1 10 20 Integer
Factory 2 Number of
Units Shipped
\$C\$14 To Store 1 10 0 Integer

Factory 3 Number of
Units Shipped
\$C\$15 To Store 1 10 90 Integer

Factory 1 Number of
Units Shipped
\$E\$13 To Store 2 10 40 Integer

Factory 2 Number of
Units Shipped
\$E\$14 To Store 2 10 0 Integer

Factory 3 Number of
Units Shipped
\$E\$15 To Store 2 10 0 Integer

Factory 1 Number of
Units Shipped
\$G\$13 To Store 3 10 0 Integer
Factory 2 Number of
Units Shipped
\$G\$14 To Store 3 10 200 Integer

Factory 3 Number of
Units Shipped
\$G\$15 To Store 3 10 40 Integer

Constraints
Cell Name Cell Value Formula Status Slack

Total Number
of Units Shipped
\$C\$17 To Store 1 110 \$C\$17=\$B\$28 Binding 0

Total Number
of Units Shipped
\$E\$17 To Store 2 40 \$E\$17=\$B\$29 Binding 0

Total Number
of Units Shipped
\$G\$17 To Store 3 240 \$G\$17=\$B\$30 Binding 0

Factory 1
\$J\$13 Total Units Shipped 60 \$J\$13<=\$B\$24 Not Binding 40
Factory 2
\$J\$14 Total Units Shipped 200 \$J\$14<=\$B\$25 Binding 0
Factory 3
\$J\$15 Total Units Shipped 130 \$J\$15<=\$B\$26 Binding 0
\$C\$13=Integer
\$C\$14=Integer
\$C\$15=Integer
\$E\$13=Integer
\$E\$14=Integer
\$E\$15=Integer
\$G\$13=Integer
\$G\$14=Integer
\$G\$15=Integer
Shipping Cost Per Unit

## Store 1 Store 2 Store 3

Factory 1 \$4 \$1 \$7
Factory 2 \$6 \$2 \$2
Factory 3 \$3 \$4 \$3

## Store 1 Store 2 Store 3

(Decision (Decision (Decision
Variables) Variables) Variables)

## Number of Total Cost Number of Total Cost Number of Total Cost

Units of Units of Units of
Shipped Shipping Shipped Shipping Shipped Shipping
To Store 1 To Store 1 To Store 2 To Store 2 To Store 3 To Store 3
Factory 1 20 \$80 40 \$40 0 \$0
Factory 2 0 \$0 0 \$0 200 \$400
Factory 3 90 \$270 0 \$0 40 \$120
Constraints

## Total Total Total

Number of Number of Number of
Units Total Cost Units Total Cost Units Total Cost
Shipped of Shipping Shipped of Shipping Shipped of Shipping
To Store 1 To Store 1 To Store 2 To Store 2 To Store 3 To Store 3
110 \$350 40 \$40 240 \$520
Constraint Constraint Constraint

Total Cost
of Shipping
(Minimize)
\$910
Objective
Constraints

## 100 = Units Available from Factory 1 ≥ Units Shipped from Factory 1

200 = Units Available from Factory 2 ≥ Units Shipped from Factory 2
130 = Units Available from Factory 3 ≥ Units Shipped from Factory 3

## 110 = Total Number of Units Ordered By Store 1

40 = Total Number of Units Ordered By Store 2
240 = Total Number of Units Ordered By Store 3
Integer All 9 Decision Variables (green cells)
(Number of Units Shipped To Each Store From Each Factory)

## Nonnegative All Unconstrained Variables

Total
Units
Shipped
60 = Units Shipped from Factory 1
200 = Units Shipped from Factory 2
130 = Units Shipped from Factory 3
Constraints
Worksheet: [New____Examples.xlsx]Outbound Marketing
Report Created: 9/6/2011 11:15:13 AM
Result: Solver found an integer solution within tolerance. All Constraints are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 3 Subproblems: 12
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Min)

Cell Name Original Value Final Value

Cost
\$G\$7 (Minimize) \$5,700 \$24,025

Variable Cells
Cell Name Original Value Final Value Integer

TV Station
Cable Station 1
Cable Station 2

Constraints
Cell Name Cell Value Formula Status Slack
\$G\$3 TV Station Ad Spend \$8,775 \$G\$3<=\$B\$12 Not Binding 225
\$G\$4 Cable Station 1 Ad Spend \$10,000 \$G\$4<=\$B\$14 Binding 0
\$G\$5 Cable Station 2 Ad Spend \$5,250 \$G\$5<=\$B\$16 Not Binding 3750
Total Effective
\$H\$7 Advertising Impressions 1,001,429 \$H\$7>=\$B\$18 Not Binding 1,429
\$F\$3=Integer
\$F\$4=Integer
\$F\$5=Integer
Decision
Variables Constraints

Number of
Needed Reach -
To Obtain 1 # of Viewers Cost
Effective Likely Reached by Per Single Number
TV Station 7 50,000 \$195 45 \$8,775
Cable Station 1 4 40,000 \$200 50 \$10,000
Cable Station 2 5 30,000 \$175 30 \$5,250

Total
Cost
(Minimize)
\$24,025
Objective

Constraints

## Nonnegative All Unconstrained Variables

Total
Effective
Impressions
Per
Vehicle
321,429
500,000
180,000

Total
Effective
Impressions
1,001,429
Constraint
Worksheet: [New____Examples.xlsx]Inbound Marketing
Report Created: 9/6/2011 11:29:40 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 3 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Max)

Cell Name Original Value Final Value

Total
Expected
Number of
Qualified
\$I\$14 (Maximize) 0 46

Variable Cells
Cell Name Original Value Final Value Integer

Constraints
Cell Name Cell Value Formula Status Slack
\$C\$14 Total Ad Spend \$5,000 \$C\$14<=\$C\$19 Binding 0
\$C\$10=Integer
\$C\$11=Integer
\$C\$9=Integer
Average Average
Number of Number of
Clicks Inquiries
Needed Needed
To Obtain To Obtain
Average 1 Active 1 Qualified

Average Average
Number of Number of
Expected Clicks Inquiries
Number of Needed Expected Needed
Average Clicks To Obtain Number To Obtain
Cost Per For the Given 1 Active of Active 1 Qualified
AdWords \$1,250 \$0.15 188 5 38 6
Facebook \$750 \$0.18 135 4 34 8
LInkedIn \$3,000 \$0.25 750 3 250 7

Decision
Variables
(Are Also
Constrained)

Spend
\$5,000
Constraint
Constraints

## Integer All 3 Decision Variables (green cells)

(Ad Spend For Each Pay-Per-Click Vehicle)

## Nonnegative All Unconstrained Variables

Expected
Number
of Qualified
6
4
36

Total
Expected
Number of
Qualified
(Maximize)
46
Objective
Worksheet: [New____Examples.xlsx]Bond Portfolio
Report Created: 9/6/2011 11:37:17 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0 Seconds.
Iterations: 2 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Max)

Cell Name Original Value Final Value

Total
Bond
Portfolio
Yield
\$G\$8 (Maximize) 7.50% 8.50%

Variable Cells
Cell Name Original Value Final Value Integer
\$E\$3 Bond 1 Portfolio Percentage 25% 0% Contin
\$E\$4 Bond 2 Portfolio Percentage 25% 0% Contin
\$E\$5 Bond 3 Portfolio Percentage 25% 83% Contin
\$E\$6 Bond 4 Portfolio Percentage 25% 17% Contin

Constraints
Cell Name Cell Value Formula Status Slack

Total
Portfolio
Held
\$E\$8 (Should Add Up To 100%) 100% \$E\$8=1 Binding 0

Total
Target Bond
Portfolio
Duration
\$F\$8 (Years) 5.5 \$F\$8=\$B\$12 Binding 0
Microsoft Excel 14.0 Sensitivity Report
Worksheet: [New____Examples.xlsx]Bond Portfolio
Report Created: 9/6/2011 11:37:18 AM

Variable Cells
Final Reduced Objective Allowable
Cell Name Value Cost Coefficient Increase
\$E\$3 Bond 1 Portfolio Percentage 0 -1.040834E-17 0.07 1.040834E-17
\$E\$4 Bond 2 Portfolio Percentage 0 0 0.08 0
\$E\$5 Bond 3 Portfolio Percentage 0.833333333 0 0.09 1E+030
\$E\$6 Bond 4 Portfolio Percentage 0.166666667 0 0.06 1E+030

Constraints
Cell Name Value Price R.H. Side Increase

Total
Portfolio
Held
\$E\$8 (Should Add Up To 100%) 1 0.03 1 0.833333333

Total
Target Bond
Portfolio
Duration
\$F\$8 (Years) 5.5 0.01 5.5 0.5
Allowable
Decrease
1E+030
1E+030
0
0

Allowable
Decrease

0.083333333

2.5
Microsoft Excel 14.0 Limits Report
Worksheet: [New____Examples.xlsx]Bond Portfolio
Report Created: 9/6/2011 11:37:18 AM

Objective
Cell Name Value

Total
Bond
Portfolio
Yield
\$G\$8 (Maximize) 8.50%

## Variable Lower Objective Upper Objective

Cell Name Value Limit Result Limit Result
\$E\$3 Bond 1 Portfolio Percentage 0% 0% 8.50% 0% 8.50%
\$E\$4 Bond 2 Portfolio Percentage 0% 0% 8.50% 0% 8.50%
\$E\$5 Bond 3 Portfolio Percentage 83% 83% 8.50% 83% 8.50%
\$E\$6 Bond 4 Portfolio Percentage 17% 17% 8.50% 17% 8.50%
Decision
Variables

Duration Yield
Bond X X
Duration Bond Portfolio Portfolio Portfolio
(Years) Yield Percentage Percentage Percentage
Bond 1 4 7% 0% 0 0.00%
Bond 2 5 8% 0% 0 0.00%
Bond 3 6 9% 83% 5 7.50%
Bond 4 3 6% 17% 0.5 1.00%

## Total Total Total

Portfolio Target Bond Bond
Held Portfolio Portfolio
Up To 100%) (Years) (Maximize)
100% 5.5 8.50%
Constraint Objective

Constraints
5.5 = Total Target Bond Portfolio Duration (Years)

## Nonnegative All Unconstrained Variables

Worksheet: [New____Examples.xlsx]Investment Selection
Report Created: 9/6/2011 11:56:19 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 4 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Max)

Cell Name Original Value Final Value

## NPV of All Cash Flows

at Year 0
\$K\$17 (Maximize) \$177,485 \$209,810

Variable Cells
Cell Name Original Value Final Value Integer
\$C\$17 Year 1 Opportunity 1 1 1 Binary
\$D\$17 Year 1 Opportunity 2 1 1 Binary
\$E\$17 Year 1 Opportunity 3 1 0 Binary
\$F\$18 Year 2 Opportunity 1 1 0 Binary
\$G\$18 Year 2 Opportunity 2 1 1 Binary
\$H\$18 Year 2 Opportunity 3 1 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack

Total Number
of Investments
\$C\$24 Made During 1st Year 2 \$C\$24<=2 Binding 0

Total Number
of Investments
\$F\$24 Made During 2nd Year 1 \$F\$24<=2 Not Binding 1
\$C\$17=Binary
\$D\$17=Binary
\$E\$17=Binary
\$F\$18=Binary
\$G\$18=Binary
\$H\$18=Binary
Projected Annual Cash Flows of All Possible Investments - Including First Year Upfront Investment

## Year 1 Year 1 Year 1 Year 2 Year 2

Opportunity 1 Opportunity 2 Opportunity 3 Opportunity 1 Opportunity 2
Year 1 (\$70,000) (\$80,000) (\$90,000)
Year 2 (\$10,000) (\$20,000) (\$15,000) (\$80,000) (\$90,000)
Year 3 (\$5,000) (\$15,000) (\$10,000) (\$10,000) (\$10,000)
Year 4 \$65,000 \$45,000 \$20,000 \$2,000 \$5,000
Year 5 \$180,000 \$150,000 \$140,000 \$25,000 \$190,000
Year 6 \$280,000 \$250,000 \$250,000 \$175,000 \$250,000

## Selection of Investment Opportunities - 1 = Invest, 0 = Don't Invest

(Decision Variables - Can Only Be Either 1 or 0)
Year 1 Opportunities
Opportunity 1 Year 2 Opportunities

Year 1 1 1 0
Year 2 0 1
Year 3
Year 4
Year 5
Year 6

## Total Number Total Number

of Investments of Investments
Year 2nd Year
2 1
Constraint Constraint

## Cash Flows As a Result of Investment Selections

Cell C30 Contains this If-Then-Else Statement: =IF(\$C\$16=1,C5," ") All Cells From C30 To I35 Contain Similar Form
Year 1 Year 1 Year 1 Year 2 Year 2
Opportunity 1 Opportunity 2 Opportunity 3 Opportunity 1 Opportunity 2
Year 1 (\$70,000) (\$80,000)
Year 2 (\$10,000) (\$20,000) (\$90,000)
Year 3 (\$5,000) (\$15,000) (\$10,000)
Year 4 \$65,000 \$45,000 \$5,000
Year 5 \$180,000 \$150,000 \$190,000
Year 6 \$280,000 \$250,000 \$250,000

Constraints

## Only 2 Investments Can be Made During Any Year

ont Investment

Year 2
Opportunity 3

(\$100,000)
(\$25,000)
(\$5,000)
\$10,000
\$45,000
Discount Rate
25%
on't Invest

Opportunities

PV of Each
Year's
Combined NPV of All
Each Year's Cash Cash Flows
Combined Flow at Year 0
Opportunity 3 Cash Flow at Year 0 (Maximize)
(\$150,000) (\$120,000) \$209,810
0 (\$120,000) (\$76,800) Objective
(\$30,000) (\$15,360)
\$115,000 \$47,104
\$520,000 \$170,394 =I21/((1+\$J\$12)^5)
\$780,000 \$204,472 =I22/((1+\$J\$12)^6)
Copied From
Chart Below

## m C30 To I35 Contain Similar Formulas

Year 2 Combined
Opportunity 3 Cash Flow
(\$150,000)
(\$120,000)
(\$30,000)
\$115,000
\$520,000
\$780,000
Worksheet: [New____Examples.xlsx]Purchase_Transportation
Report Created: 9/6/2011 12:09:57 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 Seconds.
Iterations: 9 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Min)

Cell Name Original Value Final Value

## Total Cost Of Purchasing and

Shipping Product A From
All Suppliers To All Factories
\$G\$38 (Minimize) \$2,620 \$2,105

Variable Cells
Cell Name Original Value Final Value Integer

## Factory 1 Units from

\$C\$20 Supplier 1 10 0 Integer

## Factory 2 Units from

\$C\$21 Supplier 1 10 0 Integer

## Factory 3 Units from

\$C\$22 Supplier 1 10 40 Integer

## Factory 4 Units from

\$C\$23 Supplier 1 10 0 Integer

## Factory 1 Units from

\$D\$20 Supplier 2 10 5 Integer

## Factory 2 Units from

\$D\$21 Supplier 2 10 10 Integer

## Factory 3 Units from

\$D\$22 Supplier 2 10 0 Integer

## Factory 4 Units from

\$D\$23 Supplier 2 10 0 Integer
Factory 1 Units from
\$E\$20 Supplier 3 10 0 Integer

## Factory 2 Units from

\$E\$21 Supplier 3 10 20 Integer

## Factory 3 Units from

\$E\$22 Supplier 3 10 0 Integer

## Factory 4 Units from

\$E\$23 Supplier 3 10 0 Integer

## Factory 1 Units from

\$F\$20 Supplier 4 10 15 Integer

## Factory 2 Units from

\$F\$21 Supplier 4 10 0 Integer

## Factory 3 Units from

\$F\$22 Supplier 4 10 0 Integer

## Factory 4 Units from

\$F\$23 Supplier 4 10 50 Integer

Constraints
Cell Name Cell Value Formula Status Slack
Total Number of Units
\$C\$25 Purchased From Supplier A 40 \$C\$25<=\$C\$52 Not Binding 60
Total Number of Units
\$D\$25 Purchased From Supplier B 15 \$D\$25<=\$C\$54 Binding 0
Total Number of Units
\$E\$25 Purchased From Supplier C 20 \$E\$25<=\$C\$56 Binding 0
Total Number of Units
\$F\$25 Purchased From Supplier D 65 \$F\$25<=\$C\$58 Not Binding 85
\$G\$20 Factory 1 Total Units Received 20 \$G\$20=\$C\$42 Binding 0
\$G\$21 Factory 2 Total Units Received 30 \$G\$21=\$C\$44 Binding 0
\$G\$22 Factory 3 Total Units Received 40 \$G\$22=\$C\$46 Binding 0
\$G\$23 Factory 4 Total Units Received 50 \$G\$23=\$C\$48 Binding 0
\$C\$20=Integer
\$C\$21=Integer
\$C\$22=Integer
\$C\$23=Integer
\$D\$20=Integer
\$D\$21=Integer
\$D\$22=Integer
\$D\$23=Integer
\$E\$20=Integer
\$E\$21=Integer
\$E\$22=Integer
\$E\$23=Integer
\$F\$20=Integer
\$F\$21=Integer
\$F\$22=Integer
\$F\$23=Integer
Per Unit Price of Product A From Each of 4 Suppliers

\$12 \$11 \$11 \$12

## Supplier 1 Supplier 2 Supplier 3 Supplier 4

Factory 1 \$4 \$3 \$6 \$3
Factory 2 \$7 \$4 \$4 \$5
Factory 3 \$2 \$5 \$5 \$6
Factory 4 \$6 \$6 \$8 \$4

## Amount in Units Purchased From Each Supplier For Each Factory

(Decision Variables)
Units from Units from Units from Units from
Supplier 1 Supplier 2 Supplier 3 Supplier 4 Total Units Received
Factory 1 0 5 0 15 20
Factory 2 0 10 20 0 30
Factory 3 40 0 0 0 40
Factory 4 0 0 0 50 50
Constraints

## Total Total Total Total

Number of Number of Number of Number of
Units Units Units Units
Purchased Purchased Purchased Purchased
From From From From
Supplier A Supplier B Supplier C Supplier D
40 15 20 65
Constraint Constraint Constraint Constraint

## Total Purchase Price of Product A From Each Supplier

Supplier 1 Supplier 2 Supplier 3 Supplier 4 Total
\$480 \$165 \$220 \$780 \$1,645
Total Shipping Cost of Product A From Each Supplier
Supplier 1 Supplier 2 Supplier 3 Supplier 4 Total
\$80 \$55 \$80 \$245 \$460

Total Cost
Shipping
Product A
From All Suppliers
To All Factories
(Minimize)
\$2,105
Objective

Constraints
20 = Total Units Needed By Factory 1

## Integer All 16 Decision Variables (green cells)

(Amount Purchased From Each Factory For Each Supplier)

## Nonnegative All Unconstrained Variables

ach Supplier)
Microsoft Excel 14.0 Linearity Report
Worksheet: [New____Examples.xlsx]Knapsack_Linearity_Mistake
Report Created: 9/6/2011 12:28:13 PM

## Objective Cell (Max)

Cell Name Original Value Final Value Linear Function

Total
Calories
\$E\$9 (Maximize) 1000002600 1000002600 No

Variable Cells
Cell Name Original Value Final Value Occurs Linearly

Candy Bar
Number of
\$C\$4 Objects 10 10 Yes

Sandwich
Number of
\$C\$5 Objects 10 10 Yes

Juice Can
Number of
\$C\$6 Objects 10 10 No

Apple Number
of
\$C\$7 Objects 10 10 Yes

Constraints
Cell Name Cell Value Formula Linear Function

Total
Protein
\$G\$9 (g) 630 \$G\$9>=\$B\$18 Yes

Total
Weight
\$I\$9 (kg) 12.5 \$I\$9<=\$B\$14 Yes

Total
Volume
\$K\$9 (m3) 0.0415 \$K\$9<=\$B\$16 Yes
Number of
Object Calories Protein (grams) Weight of Object (kg)
Objects
Per Per Per
Object Total Object Total Object Total
Candy Bar 10 90 900 5 50 0.25 2.5
Sandwich 10 130 1300 40 400 0.35 3.5
Juice Can 10 100 1000 15 150 0.35 3.5
Apple 10 40 400 3 30 0.3 3
Decision
Variables
Total Total Total
Calories Protein Weight
(Maximize) (g) (kg)

## 1000002600 630 12.5

Objective Cell E9 = E4+E5+E6^3+E7 Constraint Constraint
(Taking the Contents of Cell E6
To the 3rd Power Creates a
Nonlinear Condition)

Constraints

## Integer All 4 Decision Variables (green cells)

(Number of Candy Bars)
(Number of Sandwiches)
(Number of Juice Cans)
(Number of Apples)

## Nonnegative All Unconstrained Variables

Protein Weight Volume
Calories
Object Per (grams) (kg) (m3)
Per Per Per
Object Object Object Object

## Candy Bar 90 5 0.25 0.0005

Sandwich 130 40 0.35 0.002
Juice Can 100 15 0.35 0.00075
Apple 40 3 0.3 0.0009
Volume of Object (m3)

Per
Object Total
0.0005 0.005
0.002 0.020
0.00075 0.008
0.0009 0.009

Total
Volume
(m3)

0.0415
Constraint
Microsoft Excel 14.0 Feasibility Report
Worksheet: [New____Examples.xlsx]Bond Portfolio Infeasibility
Report Created: 9/6/2011 12:46:57 PM

## Constraints Which Make the Problem Infeasible

Cell Name Cell Value Formula Status Slack

Total
Portfolio
Held
\$E\$8 To 100%) 100% \$E\$8=1 Binding 0
Decision
Variables

Duration Yield
Bond X X
Duration Bond Portfolio Portfolio Portfolio
(Years) Yield Percentage Percentage Percentage
Bond 1 4 7% 0% 0.00 0.00%
Bond 2 5 8% 0% 0.00 0.00%
Bond 3 6 9% 100% 6.00 9.00%
Bond 4 3 6% 0% 0.00 0.00%

## Total Total Total

Portfolio Target Bond Bond
Held Portfolio Portfolio
Up To 100%) (Years) (Maximize)
100% 6.0 9.00%
Constraint Objective

Constraints
5.5 = Total Target Bond Portfolio Duration (Years)

## Nonnegative All Unconstrained Variables

Worksheet: [New____Examples.xlsx]Nonlinear_Regression
Report Created: 9/6/2011 2:25:32 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: GRG Nonlinear
Solution Time: 0.015 Seconds.
Iterations: 4 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Convergence 0.0001, Population Size 100, Random Seed 0, Derivatives Forward, Require Bounds
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%

## Objective Cell (Min)

Cell Name Original Value Final Value

Total of
Squared
\$G\$14 Differenced 2,556,473 2,556,343

Variable Cells
Cell Name Original Value Final Value Integer
\$B\$3 A1 -445552.937998942 -445616.4622 Contin
\$B\$4 A2 437213.662360742 437246.91807 Contin
\$B\$5 B1 0.0090951154 0.0091101876 Contin

Constraints
NONE
Microsoft Excel 14.0 Sensitivity Report
Worksheet: [New____Examples.xlsx]Nonlinear_Regression
Report Created: 9/6/2011 2:25:32 PM

Variable Cells
Final Reduced
\$B\$3 A1 -445616.4622 0
\$B\$4 A2 437246.91807 0
\$B\$5 B1 0.0091101876 0

Constraints
NONE
Microsoft Excel 14.0 Limits Report
Worksheet: [New____Examples.xlsx]Nonlinear_Regression
Report Created: 9/6/2011 2:25:32 PM

Objective
Cell Name Value

Total of
Squared
\$G\$14 Differenced 2,556,343

## Variable Lower Objective Upper Objective

Cell Name Value Limit Result Limit Result
\$B\$3 A1 = -445616.4622 #N/A #N/A #N/A #N/A
\$B\$4 A2 = 437246.91807 #N/A #N/A #N/A #N/A
\$B\$5 B1 = 0.0091101876 #N/A #N/A #N/A #N/A
Actual Predicted
Number Number of
Number of of Sales Square of
Ads Running Sales By Model Difference Difference
A1 100 50 6,700 222 6,478 41,969,612
A2 100 55 7,500 222 7,278 52,966,590
B1 0.05 59 8,700 223 8,477 71,866,061
Decision 62 8,900 223 8,677 75,291,732
Variables 75 8,800 224 8,576 73,546,153
95 10,900 226 10,674 113,943,454
110 11,200 226 10,974 120,417,836
125 11,400 227 11,173 124,829,113
140 11,500 228 11,272 127,057,343
180 12,300 230 12,070 145,693,413

Sum of
Squared
Differenced
947,581,308
Objective

E12 =\$B\$3+\$B\$4*(C12^\$B\$5)

## No Constraints - Unconstrained Variables Do Not Have to Be Nonnegative

Worksheet: [New____Examples.xlsx]Traveling_Salesman
Report Created: 9/7/2011 8:00:23 AM
Result: Solver cannot improve the current solution. All Constraints are satisfied.
Solver Engine
Engine: Evolutionary
Solution Time: 164 Seconds.
Iterations: 0 Subproblems: 125302
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Convergence 0.0001, Population Size 100, Random Seed 0, Mutation Rate 0.075, Time w/o Improve 30 sec
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

## Objective Cell (Min)

Cell Name Original Value Final Value
Total Miles
\$E\$16 (Minimize) 7199 6447

Variable Cells
Cell Name Original Value Final Value Integer
\$C\$10 1st City Visted City Row In Chart 1 5 AllDiff
\$C\$11 2nd City Visted City Row In Chart 2 4 AllDiff
\$C\$12 3rd City Visted City Row In Chart 3 2 AllDiff
\$C\$13 4th City Visted City Row In Chart 4 1 AllDiff
\$C\$14 5th City Visted City Row In Chart 5 3 AllDiff

Constraints
NONE
\$C\$10:\$C\$14=AllDiff
prove 30 sec
Microsoft Excel 14.0 Population Report
Worksheet: [New____Examples.xlsx]Traveling_Salesman
Report Created: 9/7/2011 8:00:23 AM

Variable Cells
Best Mean Standard Maximum
Cell Name Value Value Deviation Value
\$C\$10 1st City Visted City Row In Chart 5 2.382978723 1.29603517 5
\$C\$11 2nd City Visted City Row In Chart 4 3.329787234 1.454605573 5
\$C\$12 3rd City Visted City Row In Chart 2 3.691489362 1.182548694 5
\$C\$13 4th City Visted City Row In Chart 1 3.138297872 1.521184201 5
\$C\$14 5th City Visted City Row In Chart 3 2.457446809 1.142200231 5

Constraints
NONE
Minimum
Value
1
1
1
1
1
Distances Between Cities
Boston Chicago Dallas Denver
Boston 0 983 1815 1991
Chicago 983 0 1205 1050
Dallas 1815 1205 0 801
Denver 1991 1050 801 0
LA 3036 2112 1425 1174

## (Uses the Index Distance

Actual Function To From
Trip Lookup Previous
Order City Row In Chart That City) City
1st City Visted 1 Boston 3036 =INDEX(C3:G7,C10,
2nd City Visted 2 Chicago 983 =INDEX(\$C\$3:\$G\$7
3rd City Visted 3 Dallas 1205 =INDEX(\$C\$3:\$G\$7
4th City Visted 4 Denver 801 =INDEX(\$C\$3:\$G\$7
5th City Visted 5 LA 1174 =INDEX(\$C\$3:\$G\$7
Decision
Variables
(The Alldifferent
Constraint Is
Applied To All)

Total Miles
(Minimize)
7199
Objective

Contraints

## The Alldifferent Constraint Is Applied To The Entire Set of Decision Variables

LA
3036
2112
1425
1174
0

=INDEX(C3:G7,C10,C14)
=INDEX(\$C\$3:\$G\$7,C10,C11)
=INDEX(\$C\$3:\$G\$7,C11,C12)
=INDEX(\$C\$3:\$G\$7,C12,C13)
=INDEX(\$C\$3:\$G\$7,C13,C14)