lOMoARcPSD|23416644

1. Problem 3-01
Problem 3-01

Consider the following linear program:

Max 3A + 2B

s.t.

1A + 1B f 10

3A + 1B f 24

1A + 2B f 16

A, B g 0

a. Choose the correct graph which represents the optimal solution.

(i) (ii)

(iii) (iv)

Graph (i) ✔

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

b. Assume that the objective function coefficient for A changes from 3 to 5. Does the optimal solution change? Use the
graphical solution procedure to find the new optimal solution.

The same extreme point remains optimal ✔

A 7 ✔
B 3 ✔
Optimal solution 41 ✔

c. Assume that the objective function coefficient for A remains 3, but the objective function coefficient for B changes from 2
to 4. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution.

A new extreme point becomes optimal ✔

A 4 ✔
B 6 ✔
Optimal solution 36 ✔

d. The sensitivity report for the linear program in part (a) provides the following objective coefficient range information:

Objective Allowable Allowable

Variable Coefficient Increase Decrease
A 3.00000 3.00000 1.00000
B 2.00000 1.00000 1.00000

Use this objective coefficient range information to answer parts (b) and (c).

The objective coefficient range for A is from 2 ✔ to 6 ✔ so the optimal solution will not ✔
change in part (b) because the new objective coefficient is in ✔ this range.

The objective coefficient range for B is from 1 ✔ to 3 ✔ so the optimal solution will ✔ change

in part (c) because the new objective coefficient is not in ✔ this range.

Feedback

Check My Work
Correct
Post-Submission

a.

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

b. The same extreme point, and , remains optimal.

The value of the objective function becomes

c. A new extreme point, and , becomes optimal. The value of the objective function becomes .

d. The objective coefficient range for variable is 2 to 6. Since the change in part (b) is within this range, we know the optimal solution,
and , will not change. The objective coefficient range for variable is 1 to 3. Since the change in part (c) is outside this
range, we have to re-solve the problem to find the new optimal solution.

Solution

Problem 3-01

Consider the following linear program:

Max 3A + 2B

s.t.

1A + 1B f 10

3A + 1B f 24

1A + 2B f 16

A, B g 0

a. Choose the correct graph which represents the optimal solution.

(i) (ii)

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

(iii) (iv)

Graph (i)

b. Assume that the objective function coefficient for A changes from 3 to 5. Does the optimal solution change? Use
the graphical solution procedure to find the new optimal solution.

The same extreme point remains optimal

A 7

B 3

Optimal solution 41

c. Assume that the objective function coefficient for A remains 3, but the objective function coefficient for B changes
from 2 to 4. Does the optimal solution change? Use the graphical solution procedure to find the new optimal
solution.

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

A new extreme point becomes optimal

A 4

B 6

Optimal solution 36

d. The sensitivity report for the linear program in part (a) provides the following objective coefficient range
information:

Objective Allowable Allowable

Variable Coefficient Increase Decrease
A 3.00000 3.00000 1.00000
B 2.00000 1.00000 1.00000

Use this objective coefficient range information to answer parts (b) and (c).

The objective coefficient range for A is from 2 to 6 so the optimal solution will not

change in part (b) because the new objective coefficient is in this range.

The objective coefficient range for B is from 1 to 3 so the optimal solution will

change in part (c) because the new objective coefficient is not in this range.

2. Problem 3-06
Problem 3-06

Kelson Sporting Equipment, Inc., makes two different types of baseball gloves: a regular model and a catcher's model. The firm
has 900 hours of production time available in its cutting and sewing department, 300 hours available in its finishing department,
and 100 hours available in its packaging and shipping department. The production time requirements and the profit contribution
per glove are given in the following table:

Production Time (hours)

Cutting Packaging
Model and Sewing Finishing and Shipping Profit/Glove

Regular model 1

Catcher`s model

Letting
R = number of regular gloves
C = number of catcher's mitts

leads to the following formulation:

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

Max 5R + 8C

s.t.

R+ C f 900 Cutting and sewing

R+ C f 300 Finishing

R+ C f 100 Packaging and shipping

R, C g 0

The sensitivity report is shown in figure below.

Optimal Objective Value = 3700.00000

Variable Value Reduced Cost

R 500.00000 0.00000
C 150.00000 0.00000

Constraint Slack/Surplus Dual Value

1 175.00000 0.00000
2 0.00000 3.00000
3 0.00000 28.00000

Objective Allowable Allowable

Variable
Coefficient Increase Decrease
R 5.00000 7.00000 1.00000
C 8.00000 2.00000 4.66667

RHS Allowable Allowable

Constraint
Value Increase Decrease
1 900.00000 Infinite 175.00000
2 300.00000 100.00000 166.66667
3 100.00000 35.00000 25.00000

a. Determine the objective coefficients ranges.

Round your answers to two decimal places.

Objective Coefficient Range

Variable lower limit upper limit

Regular Glove 4 ✔ 12 ✔
Catcher’s Mitt 3.33 ✔ 10 ✔

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

b. Interpret the ranges in part (a).

As long as the profit per regular glove is between $4 and $12 ✔ the optimal solution of
500 regular and 150 catcher's ✔ gloves will not change.

Or as long as the profit per catcher's mitt is between $3.33 and $10 ✔ the optimal solution of
500 regular and 150 catcher's ✔ gloves will not change.

The assumption is that only one variable is ✔ changed at the same time.

c. Interpret the right-hand-side ranges. If there is no lower or upper limit, then enter the text "NA" as your answer. Round
your answers to two decimal places. Enter "0" if your answer is zero.

Constraint Right-Hand-Side Range

lower limit upper limit

Cutting and Sewing 725 ✔ NA ✔

Finishing 133.33 ✔ 400 ✔
Packaging and Shipping 75 ✔ 135 ✔

As long as the number of hours available for cutting and sewing (Constraint 1) are 725 or above ✔ the change in the

optimal value of the solution per unit increase in the right-hand side of the constraint is 0 ✔ .

As long as the number of hours available for finishing (Constraint 2) are Between 133.33 and 400 ✔ the change in
the optimal value of the solution per unit increase in the right-hand side of the constraint is 3 ✔ .

As long as the number of hours available for packaging and shipping (Constraint 3) are Between 75 and 135 ✔ the
change in the optimal value of the solution per unit increase in the right-hand side of the constraint is 28 ✔ .

d. How much will the value of the optimal solution improve if 20 extra hours of packaging and shipping time are made
available?

Amount: $ 560 ✔

Feedback

Check My Work
Correct
Post-Submission

a.

Variable Objective Coefficient Range

Regular Glove 4 to 12
Catcher's Mitt 3.33 to 10

b. As long as the profit contribution for the regular glove is between $4.00 and $12.00, the current solution is optimal.

As long as the profit contribution for the catcher's mitt stays between $3.33 and $10.00, the current solution is optimal.

The optimal solution is not sensitive to small changes in the profit contributions for the gloves.

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

c. The dual values for the resources are applicable over the following ranges:

Constraint Right-Hand-Side Range

Cutting and Sewing 725.27 to No Upper Limit
Finishing 133.20 to 400
Packaging and Shipping 75 to 134.82

d. Amount of increase

Solution

Problem 3-06

Kelson Sporting Equipment, Inc., makes two different types of baseball gloves: a regular model and a catcher's model.
The firm has 900 hours of production time available in its cutting and sewing department, 300 hours available in its
finishing department, and 100 hours available in its packaging and shipping department. The production time
requirements and the profit contribution per glove are given in the following table:

Production Time (hours)

Cutting Packaging
Model and Sewing Finishing and Shipping Profit/Glove

Regular model 1

Catcher`s model

Letting
R = number of regular gloves
C = number of catcher's mitts

leads to the following formulation:

Max 5R + 8C
s.t.

R+ C f 900 Cutting and sewing

R+ C f 300 Finishing

R+ C f 100 Packaging and shipping

R, C g 0

The sensitivity report is shown in figure below.

Optimal Objective Value = 3700.00000

Variable Value Reduced Cost

R 500.00000 0.00000
C 150.00000 0.00000

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

Constraint Slack/Surplus Dual Value

1 175.00000 0.00000
2 0.00000 3.00000
3 0.00000 28.00000

Objective Allowable Allowable

Variable
Coefficient Increase Decrease
R 5.00000 7.00000 1.00000
C 8.00000 2.00000 4.66667

RHS Allowable Allowable

Constraint
Value Increase Decrease
1 900.00000 Infinite 175.00000
2 300.00000 100.00000 166.66667
3 100.00000 35.00000 25.00000

a. Determine the objective coefficients ranges.

Round your answers to two decimal places.

Objective Coefficient Range

Variable lower limit upper limit

Regular Glove 4 12

Catcher’s Mitt 3.33 10

b. Interpret the ranges in part (a).

As long as the profit per regular glove is between $4 and $12 the optimal solution of

500 regular and 150 catcher's gloves will not change.

Or as long as the profit per catcher's mitt is between $3.33 and $10 the optimal solution of

500 regular and 150 catcher's gloves will not change.

The assumption is that only one variable is changed at the same time.

c. Interpret the right-hand-side ranges. If there is no lower or upper limit, then enter the text "NA" as your answer.
Round your answers to two decimal places. Enter "0" if your answer is zero.

Constraint Right-Hand-Side Range

lower limit upper limit

Cutting and Sewing

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

725 NA

Finishing 133.33 400

Packaging and Shipping 75 135

As long as the number of hours available for cutting and sewing (Constraint 1) are 725 or above the change

in the optimal value of the solution per unit increase in the right-hand side of the constraint is 0 .

As long as the number of hours available for finishing (Constraint 2) are Between 133.33 and 400 the

change in the optimal value of the solution per unit increase in the right-hand side of the constraint is

3 .

As long as the number of hours available for packaging and shipping (Constraint 3) are

Between 75 and 135 the change in the optimal value of the solution per unit increase in the right-hand side

of the constraint is 28 .

d. How much will the value of the optimal solution improve if 20 extra hours of packaging and shipping time are
made available?

Amount: $ 560

3. Problem 3-03
Problem 3-03

Consider the following linear program:

Min 8X + 12Y
s.t.
1X + 3Y g 9
2X + 2Y g 10
6X + 2Y g 18
X, Y g 0

a. Choose the correct graph which represents the optimal solution.

(i) (ii)

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

(iii) (iv)

Graph (iv) ✔

b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimal solution change? Use the
graphical solution procedure to find the new optimal solution. If required, round your answers to the nearest whole
number.

The same extreme point remains optimal ✔

X 3 ✔
Y 2 ✔
Optimal solution 42 ✔

c. Assume that the objective function coefficient for X remains 8, but the objective function coefficient for Y changes from 12
to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. If required,
round your answers to the nearest whole number.

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

A new extreme point becomes optimal ✔

X 2 ✔
Y 3 ✔
Optimal solution 34 ✔

d. The computer solution for the linear program in part (a) provides the following objective coefficient range information:

Variable Objective Coefficient Allowable Increase Allowable Decrease

X 8.000 4.000 4.000
Y 12.000 12.000 4.000

How would this objective coefficient range information help you answer parts (b) and (c) prior to re-solving the problem?

The objective coefficient range for variable X is 4 ✔ to 12 ✔ . Since the change in part (b) is

in ✔ this range, we know that the optimal solution will not ✔ change.

The objective coefficient range for Y is from 8 ✔ to 24 ✔ so the optimal solution will ✔ change
in part (c) because the new objective coefficient is not in ✔ this range.

Feedback

Check My Work
Correct
Post-Submission

a.

b. The same extreme point, and , remains optimal.

The value of the objective function becomes .

c. A new extreme point, and , becomes optimal. The value of the objective function becomes .

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

d. The objective coefficient range for variable is 4 to 12. Since the change in part (b) is within this range, we know that the optimal
solution, and , will not change. The objective coefficient range for variable is 8 to 24. Since the change in part (c) is
outside this range, we have to re-solve the problem to find the new optimal solution.

Solution

Problem 3-03

Consider the following linear program:

Min 8X + 12Y

s.t.

1X + 3Y g 9

2X + 2Y g 10

6X + 2Y g 18

X, Y g 0

a. Choose the correct graph which represents the optimal solution.

(i) (ii)

(iii) (iv)

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

Graph (iv)

b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimal solution change? Use
the graphical solution procedure to find the new optimal solution. If required, round your answers to the nearest
whole number.

The same extreme point remains optimal

X 3

Y 2

Optimal solution 42

c. Assume that the objective function coefficient for X remains 8, but the objective function coefficient for Y changes
from 12 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal
solution. If required, round your answers to the nearest whole number.

A new extreme point becomes optimal

X 2

Y 3

Optimal solution 34

d. The computer solution for the linear program in part (a) provides the following objective coefficient range
information:

Variable Objective Coefficient Allowable Increase Allowable Decrease

X 8.000 4.000 4.000
Y 12.000 12.000 4.000

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

How would this objective coefficient range information help you answer parts (b) and (c) prior to re-solving the
problem?

The objective coefficient range for variable X is 4 to 12 . Since the change in part (b) is

in this range, we know that the optimal solution will not change.

The objective coefficient range for Y is from 8 to 24 so the optimal solution will

change in part (c) because the new objective coefficient is not in this range.

4. Problem 3-09
Problem 3-09

Tom's, Inc., produces various Mexican food products and sells them to Western Foods, a chain of grocery stores located in Texas
and New Mexico. Tom's, Inc., makes two salsa products: Western Foods Salsa and Mexico City Salsa. Essentially, the two
products have different blends of whole tomatoes, tomato sauce, and tomato paste. The Western Foods Salsa is a blend of 50%
whole tomatoes, 30% tomato sauce, and 20% tomato paste. The Mexico City Salsa, which has a thicker and chunkier
consistency, consists of 70% whole tomatoes, 10% tomato sauce, and 20% tomato paste. Each jar of salsa produced weighs 10
ounces. For the current production period, Tom's, Inc., can purchase up to 280 pounds of whole tomatoes, 130 pounds of tomato
sauce, and 100 pounds of tomato paste; the price per pound for these ingredients is $0.96, $0.64, and $0.56, respectively. The
cost of the spices and the other ingredients is approximately $0.10 per jar. Tom's, Inc., buys empty glass jars for $0.02 each,
and labeling and filling costs are estimated to be $0.03 for each jar of salsa produced. Tom's contract with Western Foods results
in sales revenue of $1.64 for each jar of Western Foods Salsa and $1.93 for each jar of Mexico City Salsa.

Letting
W = jars of Western Foods Salsa
M = jars of Mexico City Salsa

leads to the following formulation:

Max 1W + 1.25M
s.t.
5W + 7M f 4480 Whole tomatoes
3W + 1M f 2080 Tomato sauce
2W + 2M f 1600 Tomato paste
W, M g 0

The sensitivity report is shown in figure below.

Optimal Objective Value = 860.00000

Variable Value Reduced Cost

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

W 560.00000 0.00000
M 240.00000 0.00000

Constraint Slack/Surplus Dual Value

1 0.00000 0.12500
2 160.00000 0.00000
3 0.00000 0.18750

Objective Allowable Allowable

Variable
Coefficient Increase Decrease
W 1.00000 0.25000 0.10714
M 1.25000 0.15000 0.25000

RHS Allowable Allowable

Constraint
Value Increase Decrease
1 4480.00000 1120.00000 160.00000
2 2080.00000 Infinite 160.00000
3 1600.00000 40.00000 320.00000

a. What is the optimal solution, and what are the optimal production quantities? If required, round your answers for W and M
to the nearest whole number. If required, round your answer for Profit to the nearest dollar.

W 560 ✔
M 240 ✔
Profit $ 860 ✔

b. Specify the objective coefficient ranges. Round your answers to three decimal places. If there is no lower or upper limit,
then enter the text "NA" as your answer.

Variable Objective Coefficient Range

lower limit Upper limit

Western Foods Salsa 0.893 ✔ 1.250 ✔

Mexico City Salsa 1.000 ✔ 1.400 ✔

c. What are the shadow prices for each constraint? Round your answers to three decimal places. If your answer is zero enter
"0".

Constraint Shadow Price

Whole tomatoes 0.125 ✔

Tomato sauce 0.000 ✔
Tomato paste 0.188 ✔

Interpret each shadow price.

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

The shadow price is the value that the objective function ✔ will change by if you increase the constraint by one
unit.

Whole tomatoes have a shadow price of 0.125 ✔ which means that if we add one ounce of whole tomatoes the value
of the objective function would increase by $0.125 ✔ .

Tomato sauce has a shadow price of 0 ✔ which means that if we add one ounce of tomato sauce the value of the

objective function would not change ✔ .

Tomato paste has a shadow price of 0.188 ✔ which means that if we add one ounce of tomato paste the value of the

objective function would increase by $0.188 ✔ .

Constraints with a shadow price of 0 means that ✔ .

d. Identify each of the right-hand-side ranges. If required, round your answers to the nearest whole number. If there is no
lower or upper limit, then enter the text "NA" as your answer.

Constraint Right-Hand-Side Range

lower limit upper limit

Whole tomatoes 4,320 ✔ 5,600 ✔

Tomato sauce 1,920 ✔ NA ✔
Tomato paste 1,280 ✔ 1,640 ✔

Feedback

Check My Work
Correct
Post-Submission

a. Optimal solution calls for the production of 560 jars of Western Foods Salsa and 240 jars of Mexico City Salsa; profit is $860.

b.

Variable Objective Coefficient Range

Western Foods Salsa 0.893 to 1.250
Mexico City Salsa 1.000 to 1.400

c.

Variable Dual Value Interpretation

1 0.125 One more ounce of whole tomatoes will increase profits by $0.125
2 0.000 Additional ounces of tomato sauce will not improve profits; slack of 160 ounces.
3 0.188 One more ounce of tomato paste will increase profits by $0.188

d.

Constraint Right-Hand-Side Range

1 4320 to 5600
2 1920 to No Upper Limit
3 1280 to 1640

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

Solution

Problem 3-09

Tom's, Inc., produces various Mexican food products and sells them to Western Foods, a chain of grocery stores located
in Texas and New Mexico. Tom's, Inc., makes two salsa products: Western Foods Salsa and Mexico City Salsa.
Essentially, the two products have different blends of whole tomatoes, tomato sauce, and tomato paste. The Western
Foods Salsa is a blend of 50% whole tomatoes, 30% tomato sauce, and 20% tomato paste. The Mexico City Salsa,
which has a thicker and chunkier consistency, consists of 70% whole tomatoes, 10% tomato sauce, and 20% tomato
paste. Each jar of salsa produced weighs 10 ounces. For the current production period, Tom's, Inc., can purchase up to
280 pounds of whole tomatoes, 130 pounds of tomato sauce, and 100 pounds of tomato paste; the price per pound for
these ingredients is $0.96, $0.64, and $0.56, respectively. The cost of the spices and the other ingredients is
approximately $0.10 per jar. Tom's, Inc., buys empty glass jars for $0.02 each, and labeling and filling costs are
estimated to be $0.03 for each jar of salsa produced. Tom's contract with Western Foods results in sales revenue of
$1.64 for each jar of Western Foods Salsa and $1.93 for each jar of Mexico City Salsa.

Letting
W = jars of Western Foods Salsa
M = jars of Mexico City Salsa

leads to the following formulation:

Max 1W + 1.25M
s.t.
5W + 7M f 4480 Whole tomatoes
3W + 1M f 2080 Tomato sauce
2W + 2M f 1600 Tomato paste
W, M g 0

The sensitivity report is shown in figure below.

Optimal Objective Value = 860.00000

Variable Value Reduced Cost

W 560.00000 0.00000
M 240.00000 0.00000

Constraint Slack/Surplus Dual Value

1 0.00000 0.12500
2 160.00000 0.00000
3 0.00000 0.18750

Objective Allowable Allowable

Variable
Coefficient Increase Decrease
W 1.00000 0.25000 0.10714

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

M 1.25000 0.15000 0.25000

RHS Allowable Allowable

Constraint
Value Increase Decrease
1 4480.00000 1120.00000 160.00000
2 2080.00000 Infinite 160.00000
3 1600.00000 40.00000 320.00000

a. What is the optimal solution, and what are the optimal production quantities? If required, round your answers for
W and M to the nearest whole number. If required, round your answer for Profit to the nearest dollar.

W 560

M 240

Profit $ 860

b. Specify the objective coefficient ranges. Round your answers to three decimal places. If there is no lower or upper
limit, then enter the text "NA" as your answer.

Variable Objective Coefficient Range

lower limit Upper limit

Western Foods Salsa 0.893 1.250

Mexico City Salsa 1.000 1.400

c. What are the shadow prices for each constraint? Round your answers to three decimal places. If your answer is
zero enter "0".

Constraint Shadow Price

Whole tomatoes 0.125

Tomato sauce 0.000

Tomato paste 0.188

Interpret each shadow price.

The shadow price is the value that the objective function will change by if you increase the constraint by

one unit.

Whole tomatoes have a shadow price of 0.125 which means that if we add one ounce of whole tomatoes

the value of the objective function would increase by $0.125 .

Tomato sauce has a shadow price of 0 which means that if we add one ounce of tomato sauce the

Downloaded by Amr Hemdan ([email protected])

 lOMoARcPSD|23416644

value of the objective function would not change .

Tomato paste has a shadow price of 0.188 which means that if we add one ounce of tomato paste the

value of the objective function would increase by $0.188 .

Constraints with a shadow price of 0 means that It is a non-binding constraint .

d. Identify each of the right-hand-side ranges. If required, round your answers to the nearest whole number. If there
is no lower or upper limit, then enter the text "NA" as your answer.

Constraint Right-Hand-Side Range

lower limit upper limit

Whole tomatoes 4320 5600

Tomato sauce 1920 NA

Tomato paste 1280 1640

Downloaded by Amr Hemdan ([email protected])