A Winemaker in California

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

A winemaker in California's Napa Valley must decide how much of two types of wine

she will produce from a particular variety of grapes. Each liter of table wine yields $8
profit, whereas each liter of dessert wine produces $3 profit. The labor hours and
bottling process time used for type of wine are given in the table below. Resources
available include 200 labor hours and 80 hours of bottling process time. Assume the
winemaker has more than enough grapes available to supply any feasible production
plan.

Table Desert
Labor (Hours) 0.20 0.60
Process Time (Hours) 0.30 0.10
Formulate a linear programming model that will enable the winemaker to determine
the number of liters of each type of wine to produce in order to maximize her profit.
(Points: 7)
X2 -
X1 - Table Dessert RHS Dual
Maximize 8 3
Constraint
1 0.2 0.6 <= 200 0.625
Constraint
2 0.3 0.1 <= 80 26.25
Solution-> 175 275 Profit $2,225

1. Refer to the scenario. Find an optimal solution to the model in 6 and determine the
maximum profit. (Points: 7)
X2 -
X1 - Table Dessert RHS Dual
Maximize 8 3
Constraint
1 0.2 0.6 <= 200 0.625
Constraint
2 0.3 0.1 <= 80 26.25
Solution-> 175 275 Profit $2,225

1. Refer to the scenario. Implement the model of 6 in Excel Solver and obtain an
answer report. Which constraint(s) are binding on the optimal solution? (Points: 7)
Reduced Original Lower Upper
Variable Value Cost Val Bound Bound
X1 175 0 8 1 9
X2 275 0 3 2.6667 24
Dual Slack/Surplu Original Lower Upper
Constraint Value s Val Bound Bound
Constraint
1 0.625 0 200 53.3333 480
Constraint
2 26.25 0 80 33.3333 300
1. ) Refer to the scenario. Obtain a sensitivity report for the model in 6. How much
should the winemaker be willing to pay for an additional labor hour? (Points: 7)
Basic
Cj Variables 8 X1 3 X2 0 slack 1 0 slack 2 Quantity
Iteration 1
0 slack 1 0.2 0.6 1 0 200
0 slack 2 0.3 0.1 0 1 80
zj 0 0 0 0 0
cj-zj 8 3 0 0
Iteration 2
146.666
0 slack 1 0 0.5333 1 -0.6667 7
266.666
8 X1 1 0.3333 0 3.3333 7
zj 8 2.6667 0 26.6667 2,133.33
cj-zj 0 0.3333 0 -26.6667
Iteration 3
3 X2 0 1 1.875 -1.25 275
8 X1 1 0 -0.625 3.75 175
zj 8 3 0.625 26.25 2,225.00
cj-zj 0 0 -0.625 -26.25

You might also like