Chap 003

CHAPTER 3
LINEAR PROGRAMMING:
FORMULATION AND APPLICATIONS
SOLUTION TO SOLVED PROBLEMS
3.S1 Farm Management

Dwight and Hattie have run the family farm for over thirty years. They are currently planning
the mix of crops to plant on their 120-acre farm for the upcoming season. The table below gives
the labor hours and fertilizer required per acre, as well as the total expected profit per acre for
each of the potential crops under consideration. Dwight, Hattie, and their children can work at
most 6,500 total hours during the upcoming season. They have 20 tons of fertilizer available.
What mix of crops should be planted to maximize the familys total profit. Formulate and solve a
linear programming model in a spreadsheet.
Labor Required Fertilizer Required Expected Profit

Crop (hours per acre) (tons per acre) (per acre)
Oats 50 1.5 $500

Wheat 60 2 $600
Corn 105 4 $950
This is a resource-allocation problem. The activities are the planting of the three crops and the
limited resources are land, labor, and fertilizer. We will therefore build a spreadsheet following the
template for resource-allocation problems in Figure 3.4. Start by entering the data. The data for
this problem are the labor required, fertilizer required, and expected profit for each crop (per
acre). Following the template, the data in the spreadsheet would be entered as displayed below,
where range names of ProfitPerAcre (C4:E4) and TotalAvailable (H7:H9) are assigned to the
corresponding data cells.
B C D E F G H
3 Oats Wheat Corn
4 Profit (per acre) $500 $600 $950
5 Total
6 Resources Resources Used per Acre Available
7 Land (acres) 1 1 1 120
8 Labor (hours) 50 60 105 6500
9 Fertilizer (tons) 1.5 2 4 200
1
The decisions to be made in this problem are how many acres of each crop to plant. Therefore, we
add three changing cells in C12:E12 with range name AcresPlanted. The values in AcresPlanted
(C12:E12) will eventually be determined by the Solver. For now, an arbitrary value of 1 is entered
for each crop.
B C D E F G H
3 Oats Wheat Corn
4 Profit (per acre) $500 $600 $950
5 Total
7 Land (acres) 1 1 1 120
8 Labor (hours) 50 60 105 6500
10
11
12 Acres Planted 1 1 1
The goal is to maximize the familys total profit. Thus, the target cell should calculate the total
profit. In this case, the total profit will be
Total Profit = ($500)(acres of oats) + ($600)(acres of wheat) + ($950)(acres of corn)
or
Total Profit = SUMPRODUCT(ProfitPerAcre, AcresPlanted).
This formula is entered into cell H12. With 1 acre of each crop planted, the total cost would be
($500)(1) + ($600)(1) + ($950)(1) = $2,050.
B C D E F G H
3 Oats Wheat Corn
4 Profit (per acre) $500 $600 $950
5 Total
7 Land (acres) 1 1 1 120
8 Labor (hours) 50 60 105 6500
10
11 Total Profit
12 Acres Planted 1 1 1 $2,050
H
11 Total Profit
12 =SUMPRODUCT(ProfitPerAcre,AcresPlanted)
2
The functional constraints in this problem involve the limited resources of land, labor, and
fertilizer. Given the AcresPlanted (the changing cells in C12:E12), we calculate the total resources
used in TotalUsed (cells F7:F9). For land, this will be =SUMPRODUCT(C7:E7, AcresPlanted).
Using a range name or an absolute reference for the acres planted, this formula can be copied into
cells F8:F9 to calculate the amount of labor and fertilizer used. The total resources used must be
<= TotalAvailable (H7:H9), as indicated by the <= in G7:G9.
B C D E F G H
3 Oats Wheat Corn
4 Profit (per acre) $500 $600 $950
5 Total Total
6 Resources Resources Used per Acre Used Available
7 Land (acres) 1 1 1 3 <= 120
8 Labor (hours) 50 60 105 215 <= 6500
9 Fertilizer (tons) 1.5 2 4 8 <= 200
10
11 Total Profit
12 Acres Planted 1 1 1 $2,050
F
5 Total
6 Used
7 =SUMPRODUCT(C7:E7,AcresPlanted)
3
The Solver information and solved spreadsheet are shown below.
A B C D E F G H
1 Farm Management
2
3 Oats Wheat Corn
4 Profit (per acre) $500 $600 $950
5 Total Total
6 Resources Resources Used per Acre Used Available
7 Land (acres) 1 1 1 120 <= 120
8 Labor (hours) 50 60 105 6,400 <= 6500
9 Fertilizer (tons) 1.5 2 4 200 <= 200
10
11 Total Profit
12 Acres Planted 80 40 0 $64,000
Range Name Cells

AcresPlanted C12:E12
ProfitPerAcre C4:E4
TotalAvailable H7:H9
TotalProfit H12
TotalUsed F7:F9
F
5 Total
6 Used
H
11 Total Profit
12 =SUMPRODUCT(ProfitPerAcre,AcresPlanted)
Thus, oats should be planted on 80 acres and wheat on 40 acres, while not planting any corn, with
a resulting total profit of $64,000.
4
3.S2 Diet Problem
The kitchen manager for Sing Sing Prison is trying to decide what to feed its prisoners. She
would like to offer some combination of milk, beans, and oranges. The goal is to minimize cost,
subject to meeting the minimum nutritional requirements imposed by law. The cost and
nutritional content of each food, along with the minimum nutritional requirements, are shown
below. What diet should be fed to each prisoner? Formulate and solve a linear programming
model in a spreadsheet.
Navy Oranges Minimum
Milk Beans (large Calif. Daily
(gallons) (cups) Valencia) Requirement
Niacin (mg) 3.2 4.9 0.8 13.0
Thiamin (mg) 1.12 1.3 0.19 1.5
Vitamin C (mg) 32.0 0.0 93.0 45.0
Cost ($) 2.00 0.20 0.25
This is a cost-benefit-trade-off problem. The activities are the quantities of food to feed each
prisoner and the required benefits are the minimum nutritional requirements. We will therefore
build a spreadsheet following the template for cost-benefit-trade-off problems in Figure 3.6. Start
by entering the data. The data for this problem are the nutrient content of each food, the minimum
daily requirement for each nutrient, and the cost of each food. Following the template, the data in
the spreadsheet would be entered as displayed below, where range names of UnitCost (C5:E5),
NutritionalContents (C9:E11), and MinimumRequirement (H9:H11) are assigned to the
corresponding data cells.
B C D E F G H
3 Milk Beans
4 (gal.) (cups) Oranges
5 Unit Cost $2.00 $0.20 $0.25
6
7 Minimum
8 Nutritional Contents (mg) Requirement
9 Niacin 3.2 4.9 0.8 13
10 Thiamin 1.12 1.3 0.19 1.5
11 Vitamin C 32 0 93 45
5
The decisions to be made in this problem are how much of each food type should be fed to each
prisoner. Therefore, we add three changing cells in C13:E13, with range name Quantity. The
values in Quantity (C13:E13) will eventually be determined by the Solver. For now, an arbitrary
value of 1 is entered for each food type.
The goal is to minimize the total cost per prisoner. Thus, the target cell should calculate this cost:
Total Cost = ($2)(gallons of milk) + ($0.20)(cups of beans) + ($0.25)(number of oranges)
or
Total Cost = SUMPRODUCT(UnitCost, Quantity).
This formula is entered into cell H14.
B C D E F G H
3 Milk Beans
5 Unit Cost $2.00 $0.20 $0.25
6
7 Minimum
8 Nutritional Contents (mg) Requirement
9 Niacin 3.2 4.9 0.8 13
10 Thiamin 1.12 1.3 0.19 1.5
11 Vitamin C 32 0 93 45
12
13 Quantity 1 1 1 Total Cost
14 (per prisoner) $2.45
H
13 Total Cost
14 =SUMPRODUCT(UnitCost,Quantity)
6
The functional constraints in this problem involve the minimum daily requirement of each nutrient.
Given the amount of food fed each prisoner (the changing cells in C13:E13), we calculate the
total resources used in F9:F11. For niacin, this will be =SUMPRODUCT(C9:E9, $C$13:$E$13).
Using an absolute reference for the acres planted, this formula can be copied into cells F10-F11 to
calculate the thiamin and vitamin C. The benefit achieved (total of each nutrient) must be >= the
minimum needed (H9:H11), as indicated by the >= in G9:G11.
B C D E F G H
3 Milk Beans
5 Unit Cost $2.00 $0.20 $0.25
6
7 Total Minimum
8 Nutritional Contents (mg) Nutrients Requirement
9 Niacin 3.2 4.9 0.8 8.9 >= 13
10 Thiamin 1.12 1.3 0.19 2.610 >= 1.5
11 Vitamin C 32 0 93 125 >= 45
12
13 Quantity 1 1 1 Total Cost
F
7 Total
8 Nutrients
9 =SUMPRODUCT(C9:E9,Quantity)
7
A B C D E F G H
1 The Prison Diet Problem
2
3 Milk Beans
5 Unit Cost $2.00 $0.20 $0.25
6
7 Total Minimum
8 Nutritional Contents (mg) Nutrients Requirement
9 Niacin 3.2 4.9 0.8 13 >= 13
10 Thiamin 1.12 1.3 0.19 3.438 >= 1.5
11 Vitamin C 32 0 93 45 >= 45
12
13 Quantity 0 2.574 0.484 Total Cost
Range Name Cells

MinimumRequirement H9:H11
NutritionalContents C9:E11
Quantity C13:E13
TotalCost H14
TotalNutrients F9:F11
UnitCost C5:E5
F
7 Total
8 Nutrients
9 =SUMPRODUCT(C9:E9,Quantity) H
10 =SUMPRODUCT(C10:E10,Quantity) 13 Total Cost
11 =SUMPRODUCT(C11:E11,Quantity) 14 =SUMPRODUCT(UnitCost,Quantity)
Thus, each prisoner should be fed a daily average of 2.574 cups of beans and 0.484 oranges for a
total cost of $0.64.
8
3.S3 Cutting Stock Problem
Decora Accessories manufactures a variety of bathroom accessories, including decorative towel
rods and shower curtain rods. Each of the accessories includes a rod made out of stainless steel.
However, many different lengths are needed: 12, 18, 24, 40, and 60. Decora purchases
60 rods from an outside supplier and then cuts the rods as needed for their products. Each 60
rod can be used to make a number of smaller rods. For example, a 60 rod could be used to
make a 40 and an 18 rod (with 2 of waste), or 5 12 rods (with no waste). For the next
production period, Decora needs 25 12 rods, 52 18 rods, 45 24 rods, 30 40 rods, and 12
60 rods. What is the fewest number of 60 rods that can be purchased to meet their production
needs? Formulate and solve an integer programming model in a spreadsheet.
This is a cost-benefit-trade-off problem. For each length of rod, the required benefit is obtaining
the minimum number needed of those rods. Each possible way of cutting a 60 rod will represent
an activity. For example, a 60 rod can be cut into 5 12 rods, or 3 12 rods and an 18 rod (with
6 scrap), or 3 12 rods and a 24 rod, etc. We will build a spreadsheet following the template for
cost-benefit-trade-off problems in Figure 3.6. Start by entering the data. The data for this problem
are the total length of the uncut rods, the minimum number of each rod length required and, for
each possible pattern of cutting a 60 rod, the number of each length rod created. There are 11
possible patterns of cutting a 60 rod that either leave no scrap or an unusable piece of scrap (i.e.,
less than 12). Following the template, the data in the spreadsheet would be entered as displayed,
where range names of UncutRodLength (F3), MinimumRequirement (P7:P11), and Waste
(C12:M12) are assigned to the corresponding data cells.
B C D E F G H I J K L M N O P
3 Length of Uncut Rods 60
4
5 Length of Pattern Minimum
6 Cut Rod 1 2 3 4 5 6 7 8 9 10 11 Requirement
7 12 5 3 3 2 1 1 1 25
8 18 1 2 1 3 2 1 52
9 24 1 1 2 1 45
10 40 1 1 30
11 60 1 12
12 Waste 0 6 0 0 6 0 8 6 0 2 0
B C
12 Waste =UncutRodLength-SUMPRODUCT($B$7:$B$11,C7:C11)
9
The decisions to be made in this problem are how many rods should be cut into each of the
possible patterns. Therefore, we add 11 changing cells in C14:M14, with range name
PatternQuantity. The values in PatternQuantity (C14:M14) will eventually be determined by the
Solver. For now, an arbitrary value of 1 is entered for each pattern.
4
6 Cut Rod 1 2 3 4 5 6 7 8 9 10 11 Needed
7 12 5 3 3 2 1 1 1 25
8 18 1 2 1 3 2 1 52
9 24 1 1 2 1 45
10 40 1 1 30
11 60 1 12
12 Waste 0 6 0 0 6 0 8 6 0 2 0
13
14 Pattern Quantity 1 1 1 1 1 1 1 1 1 1 1
The goal is to minimize the total number of 60 (uncut) rods needed. This is just the sum of the
changing cells:
Total Uncut Rods needed = SUM(PatternQuantity).
This formula is entered into cell P14.
4
6 Cut Rod 1 2 3 4 5 6 7 8 9 10 11 Needed
7 12 5 3 3 2 1 1 1 25
8 18 1 2 1 3 2 1 52
9 24 1 1 2 1 45
10 40 1 1 30
11 60 1 12
12 Waste 0 6 0 0 6 0 8 6 0 2 0
13 Total Uncut Rods Needed
14 Pattern Quantity 1 1 1 1 1 1 1 1 1 1 1 11
P
14 =SUM(PatternQuantity)
10
The functional constraints in this problem require that the number of cut rods of each length must
be at least the minimum number needed. Given PatternQuantity (the changing cells in C14:M14),
we calculate the total number of each rod length produced in TotalProduced (N7:N11). For 12
rods, this will be =SUMPRODUCT(C7:M7, PatternQuantity). Using a range name or absolute
reference for the quantity of each pattern, this formula can be copied into cells N8:N11 to
calculate the total number of other lengths created. For each rod length, the benefit achieved (the
total number of that rod length cut) must be >= MinimumRequirement (P7:P11), as indicated by
the >= in O7:O11.
4
5 Length of Pattern Total Minimum
6 Cut Rod 1 2 3 4 5 6 7 8 9 10 11 Produced Needed
7 12 5 3 3 2 1 1 1 16 >= 25
8 18 1 2 1 3 2 1 10 >= 52
9 24 1 1 2 1 5 >= 45
10 40 1 1 2 >= 30
11 60 1 1 >= 12
12 Waste 0 6 0 0 6 0 8 6 0 2 0
N
5 Total
6 Produced
7 =SUMPRODUCT(C7:M7,PatternQuantity)
11
Also, an integer number of each pattern must be cut. Therefore, we constrain the changing cells to
be integer. The Solver information and solved spreadsheet are shown below.
A B C D E F G H I J K L M N O P
1 Cutting Stock Problem
2
4
5 Length of Pattern Total Minimum
6 Cut Rod 1 2 3 4 5 6 7 8 9 10 11 Produced Needed
7 12 5 3 3 2 1 1 1 27 >= 25
8 18 1 2 1 3 2 1 52 >= 52
9 24 1 1 2 1 45 >= 45
10 40 1 1 30 >= 30
11 60 1 12 >= 12
12 Waste 0 6 0 0 6 0 8 6 0 2 0
Range Name Cells

MinimumNeeded P7:P11
PatternQuantity C14:M14
TotalProduced N7:N11
TotalRodsNeeded P14
UncutRodLength F3
Waste C12:M12
N
5 Total
6 Produced
B C
12 Waste =UncutRodLength-SUMPRODUCT($B$7:$B$11,C7:C11)
P
14 =SUM(PatternQuantity)
Thus, PatternQuantity (C14:M14) show the number of rods that should be cut into the respective
patterns. TotalRodsNeeded (P14) indicates that a total of 72 uncut rods are needed.
12
3.S4 Bidding for Classes
In the MBA program at a prestigious university in the Pacific Northwest, students bid for
electives in the second year of their program. Each student has 100 points to bid (total) and
must take two electives. There are four electives available: Management Science, Finance,
Operations Management, and Marketing. Each class is limited to 5 students. The bids submitted
for each of the 10 students are shown in the table below.
Management Operations
Student Science Finance Management Marketing
George 60 10 10 20
Fred 20 20 40 20
Ann 45 45 5 5
Eric 50 20 5 25
Susan 30 30 30 10
Liz 50 50 0 0
Ed 70 20 10 0
David 25 25 35 15
Tony 35 15 35 15
Jennifer 60 10 10 20
a. Formulate and solve a spreadsheet model to determine an assignment of students to classes so

as to maximize the total bid points of the assignments.
This is a special kind of assignment problem. The assignees are the students and the tasks are the
classes. Each student is assigned to take two classes. Each class has a limit of five students. Start
by entering the data. The data for this problem are the bid points for each student for each class,
where the corresponding data cells are assigned a range name of Points (C5:F14).
B C D E F
3 Management Operations
4 Points Science Finance Management Marketing
5 George 60 10 10 20
6 Fred 20 20 40 20
7 Ann 45 45 5 5
8 Eric 50 20 5 25
9 Susan 30 30 30 10
10 Liz 50 50 0 0
11 Ed 70 20 10 0
12 David 25 25 35 15
13 Tony 35 15 35 15
14 Jennifer 60 10 10 20
13
The decisions to be made in this problem are whether or not to assign each student to each class.
Therefore, a table of changing cells is created for each student and class combination in C18:F27,
and given a range name of Assignment. The values in Assignment (C18:F27) will eventually be
determined by the Solver. For now, arbitrary values of 0 and 1 are entered.
B C D E F
5 George 60 10 10 20
6 Fred 20 20 40 20
7 Ann 45 45 5 5
8 Eric 50 20 5 25
9 Susan 30 30 30 10
10 Liz 50 50 0 0
11 Ed 70 20 10 0
12 David 25 25 35 15
13 Tony 35 15 35 15
14 Jennifer 60 10 10 20
15
17 Assignment Science Finance Management Marketing
18 George 1 0 1 0
19 Fred 0 1 0 1
20 Ann 1 0 1 0
21 Eric 0 1 0 1
22 Susan 1 0 1 0
23 Liz 0 1 0 1
24 Ed 1 0 1 0
25 David 0 1 0 1
26 Tony 1 0 1 0
27 Jennifer 0 1 0 1
14
The goal is to maximize the total bid points of the assignments.
Total Bid Points = SUMPRODUCT(Points, Assignment).
This formula is entered into cell I29.
B C D E F G H I
5 George 60 10 10 20
6 Fred 20 20 40 20
7 Ann 45 45 5 5
8 Eric 50 20 5 25
9 Susan 30 30 30 10
10 Liz 50 50 0 0
11 Ed 70 20 10 0
12 David 25 25 35 15
13 Tony 35 15 35 15
14 Jennifer 60 10 10 20
15
17 Assignment Science Finance Management Marketing
18 George 1 0 1 0
19 Fred 0 1 0 1
20 Ann 1 0 1 0
21 Eric 0 1 0 1
22 Susan 1 0 1 0
23 Liz 0 1 0 1
24 Ed 1 0 1 0
25 David 0 1 0 1
26 Tony 1 0 1 0
27 Jennifer 0 1 0 1
28
29 Total Points 535
H I
29 Total Points =SUMPRODUCT(Points,Assignment)
15
The functional constraints in this problem are that each student must be assigned to two classes,
each class is limited to five students, and each student can take each class at most once. The
number of classes a student is assigned to is just the sum of the row of changing cells for each
student. For example, for George it is =SUM(C18:F18). This formula is copied into G18:G27.
The number of students assigned to a class is the sum of the column of changing cells for each
class. For example, for Management Science it is =SUM(C18:C27). This formula is copied into
C28:F28.
B C D E F G H I
5 George 60 10 10 20
6 Fred 20 20 40 20
7 Ann 45 45 5 5
8 Eric 50 20 5 25
9 Susan 30 30 30 10
10 Liz 50 50 0 0
11 Ed 70 20 10 0
12 David 25 25 35 15
13 Tony 35 15 35 15
14 Jennifer 60 10 10 20
15
16 Management Operations Total Classes
17 Assignment Science Finance Management Marketing Classes to Take
18 George 1 0 1 0 2 = 2
19 Fred 0 1 0 1 2 = 2
20 Ann 1 0 1 0 2 = 2
21 Eric 0 1 0 1 2 = 2
22 Susan 1 0 1 0 2 = 2
23 Liz 0 1 0 1 2 = 2
24 Ed 1 0 1 0 2 = 2
25 David 0 1 0 1 2 = 2
26 Tony 1 0 1 0 2 = 2
27 Jennifer 0 1 0 1 2 = 2
28 5 5 5 5
29 <= <= <= <= Total Points 535
30 Capacity 5 5 5 5
K
16 Total
17 Classes
18 =SUM(C18:F18)
19 =SUM(C19:F19)
20 =SUM(C20:F20)
21 =SUM(C21:F21)
22 =SUM(C22:F22)
23 =SUM(C23:F23)
24 =SUM(C24:F24)
25 =SUM(C25:F25)
26 =SUM(C26:F26)
27 =SUM(C27:F27)
B C D E F
28 Total in Class =SUM(C18:C27) =SUM(D18:D27) =SUM(E18:E27) =SUM(F18:F27)
16
A B C D E F G H I J K
1 Bidding for Classes
2
5 George 60 10 10 20
6 Fred 20 20 40 20
7 Ann 45 45 5 5
8 Eric 50 20 5 25
9 Susan 30 30 30 10
10 Liz 50 50 0 0
11 Ed 70 20 10 0
12 David 25 25 35 15
13 Tony 35 15 35 15
14 Jennifer 60 10 10 20
15
16 Management Operations Total Classes Student
17 Assignment Science Finance Management Marketing Classes to Take Points
18 George 1 0 0 1 2 = 2 80
19 Fred 0 0 1 1 2 = 2 60
20 Ann 1 1 0 0 2 = 2 90
21 Eric 0 1 0 1 2 = 2 45
22 Susan 0 1 1 0 2 = 2 60
23 Liz 1 1 0 0 2 = 2 100
24 Ed 1 0 1 0 2 = 2 80
25 David 0 1 1 0 2 = 2 60
26 Tony 0 0 1 1 2 = 2 50
27 Jennifer 1 0 0 1 2 = 2 80
28 Total in Class 5 5 5 5
29 <= <= <= <= Total Points 705
30 Capacity 5 5 5 5
Range Name Cells

Assignment C18:F27
Capacity C30:F30
ClassesToTake I18:I27
Points C5:F14
StudentPoints K18:K27
TotalClasses G18:G27
TotalInClass C28:F28
TotalPoints I29
G K
16 Total 16 Student
17 Classes 17 Points
18 =SUM(C18:F18) 18 =SUMPRODUCT(C5:F5,C18:F18)
21 : 21 :
22 : 22 :
B C D E F
28 Total in Class =SUM(C18:C27) =SUM(D18:D27) =SUM(E18:E27) =SUM(F18:F27)
H I
29 Total Points =SUMPRODUCT(Points,Assignment)
17
Thus, the 1s in Assignment (C18:F27) show the assignments that should be made, achieving a
total of 705 points.
b. Does the resulting solution seem like a fair assignment?

No. For example, Eric did not get into Management Science despite bidding 50 points, while Ann
got in with only 45 points. Also, Eric got into classes worth only 45 total bid points to him while
Liz got classes worth 100 bid points to her.
c. Which alternative objectives might lead to a fairer assignment?
Perhaps maximizing the minimum total number of bid points achieved by each student.
18

Chap 003

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chap 003

Uploaded by

Copyright:

Available Formats

CHAPTER 3

3.S1 Farm Management

Labor Required Fertilizer Required Expected Profit

Oats 50 1.5 $500

Range Name Cells

Range Name Cells

Range Name Cells

a. Formulate and solve a spreadsheet model to determine an assignment of students to classes so

Range Name Cells

b. Does the resulting solution seem like a fair assignment?

You might also like