Deck 3: Linear Programming: Computer Solution and Sensitivity Analysis

Full screen (f)
exit full mode
Question
Sensitivity analysis determines how a change in a parameter affects the optimal solution.
Use Space or
up arrow
down arrow
to flip the card.
Question
Most computer linear programming packages readily accept constraints entered in fractional form, such as X1/X3.
Question
The sensitivity range for an objective function coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.
Question
The marginal value of any scarce resource is the dollar amount one should be willing to pay for one additional unit of that scarce resource.
Question
Sensitivity ranges can be computed only for the right-hand sides of constraints.
Question
The shadow price for a positive decision variable is 0.
Question
A change in the value of an objective function coefficient will always change the value of the optimal solution.
Question
When the right-hand sides of two constraints are both increased by one unit, the value of the objective function will be adjusted by the sum of the constraints' prices.
Question
Because the management science model requires that parameters are known with certainty, sensitivity analysis is not used in practical, real-world applications of linear programming.
Question
If we change the constraint quantity to a value outside the sensitivity range for that constraint quantity, the shadow price will change.
Question
The terms shadow price and dual price mean the same thing.
Question
For a profit maximization problem, if the allowable increase for a coefficient in the objective function is infinite, then profits are unbounded.
Question
The sensitivity range for a ________ is the range of values over which the quantity values can change without changing the shadow price.
Question
The sensitivity range for a constraint quantity value is the range over which the shadow price is valid.
Question
The sensitivity range for an objective function coefficient is the range of values over which the profit does not change.
Question
The sensitivity range for a constraint quantity value is the range over which the optimal values of the decision variables do not change.
Question
Sensitivity analysis can be used to determine the effect on the solution for changing several parameters at once.
Question
The simplex method is a graphical technique used to solve all management science problems.
Question
The reduced cost (shadow price) for a positive decision variable is ________.
Question
The accepted sequence for sensitivity analysis is objective function, left-hand side, and right-hand side.
Question
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -What is the shadow price for assembly?<div style=padding-top: 35px>

-What is the shadow price for assembly?
Question
The sensitivity range for a constraint quantity value is also the range over which the ________ is valid.
Question
For humanitarian reasons, Taco Loco decides they would rather make product X than product Y. The dollar amount that they can both increase the price of Y and reduce the price of X by to accomplish this reversal of demand is ________.
Question
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -How many tractors and saws should be produced to maximize profit, and how much profit will they make?<div style=padding-top: 35px>

-How many tractors and saws should be produced to maximize profit, and how much profit will they make?
Question
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-If the company wanted to increase the available hours for one of their constraints (assembly, painting, or inspection) by two hours, they should increase ________.
Question
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management.
Max R = 14Z + 13Y + 17X
subject to:
Beef 2Z + 3Y + 4X ≤ 28
Cheese 9Z + 8Y + 11X ≤ 80
Beans 4Z + 4Y + 2X ≤ 68
X,Y,Z ≥ 0
The sensitivity report from the computer model reads as follows:
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management. Max R = 14Z + 13Y + 17X subject to: Beef 2Z + 3Y + 4X ≤ 28 Cheese 9Z + 8Y + 11X ≤ 80 Beans 4Z + 4Y + 2X ≤ 68 X,Y,Z ≥ 0 The sensitivity report from the computer model reads as follows:   Taco Loco will make the same quantity of X, Y, and Z if the amount of cheese at their disposal is between ________ pounds and ________ pounds.<div style=padding-top: 35px>
Taco Loco will make the same quantity of X, Y, and Z if the amount of cheese at their disposal is between ________ pounds and ________ pounds.
Question
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-A change in the market has increased the profit on the super product by $5. Total profit will increase by ________.
Question
The sensitivity range for a(n) ________ coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.
Question
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management.
Max R = 14Z + 13Y + 17X
subject to:
Beef 2Z + 3Y + 4X ≤ 28
Cheese 9Z + 8Y + 11X ≤ 80
Beans 4Z + 4Y + 2X ≤ 68
X,Y,Z ≥ 0
The sensitivity report from the computer model reads as follows:
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management. Max R = 14Z + 13Y + 17X subject to: Beef 2Z + 3Y + 4X ≤ 28 Cheese 9Z + 8Y + 11X ≤ 80 Beans 4Z + 4Y + 2X ≤ 68 X,Y,Z ≥ 0 The sensitivity report from the computer model reads as follows:   Taco Loco should produce both ________ but should not make any ________.<div style=padding-top: 35px>
Taco Loco should produce both ________ but should not make any ________.
Question
________ is the analysis of the effect of parameter changes on the optimal solution.
Question
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -What is the shadow price for fabrication?<div style=padding-top: 35px>

-What is the shadow price for fabrication?
Question
What is the maximum amount a manager would be willing to pay for one additional hour of machining time?
Question
A breakdown in fabrication causes the available hours to drop from 120 to 90 hours. How will this impact the optimal number of tractors and mowers produced?
Question
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-The profit on the super product could increase by ________ without affecting the product mix.
Question
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -Determine the sensitivity range for the profit for tractors.<div style=padding-top: 35px>

-Determine the sensitivity range for the profit for tractors.
Question
If Taco Loco reduces the price of the X product by about 82 cents, then their optimal product mix will contain ________ X.
Question
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-The optimal number of regular products to produce is ________, and the optimal number of super products to produce is ________, for total profits of ________.
Question
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management.
Max R = 14Z + 13Y + 17X
subject to:
Beef 2Z + 3Y + 4X ≤ 28
Cheese 9Z + 8Y + 11X ≤ 80
Beans 4Z + 4Y + 2X ≤ 68
X,Y,Z ≥ 0
The sensitivity report from the computer model reads as follows:
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management. Max R = 14Z + 13Y + 17X subject to: Beef 2Z + 3Y + 4X ≤ 28 Cheese 9Z + 8Y + 11X ≤ 80 Beans 4Z + 4Y + 2X ≤ 68 X,Y,Z ≥ 0 The sensitivity report from the computer model reads as follows:   Taco Loco should try to purchase additional ________, but should not buy more ________.<div style=padding-top: 35px>
Taco Loco should try to purchase additional ________, but should not buy more ________.
Question
What is the range for the shadow price for assembly?
Question
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-If downtime reduced the available capacity for painting by 40 hours (from 300 to 260 hours), profits would be reduced by ________.
Question
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Graphically solve this problem and answer the following questions.
What is the optimal product mix and maximum profit?
Question
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display. Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX 100x1+120x2+150x3+125x4100 x _ { 1 } + 120 x _ { 2 } + 150 x _ { 3 } + 125 x _ { 4 }
Subject to 1 . x1+2x2+2x3+2x4108x _ { 1 } + 2 x _ { 2 } + 2 x _ { 3 } + 2 x _ { 4 } \leq 108
   2. 3x1+5x2+x41203 x _ { 1 } + 5 x _ { 2 } + x _ { 4 } \leq 120
   3. x1+x325x _ { 1 } + x _ { 3 } \leq 25
   4. x2+x3+x450x _ { 2 } + x _ { 3 } + x _ { 4 } \geq 50
    x1,x2,x3,x40x _ { 1 } , x _ { 2 } , x _ { 3 } , x _ { 4 } \geq 0
Optimal Solution:
Objective Function Value = 7475.000

 Variable  Value  Reduced  Costs x180x205x3170x4330\begin{array} { c | c | c } \text { Variable } & \text { Value } & \begin{array} { c } \text { Reduced } \\\text { Costs }\end{array} \\\hline x _ { 1 } & 8 & 0 \\x _ { 2 } & 0 & 5 \\x _ { 3 } & 17 & 0 \\x _ { 4 } & 33 & 0\end{array}

 Constraint  Slack/  Surplus  Dual Prices 1075263030254025\begin{array} { c c c } \text { Constraint } & \begin{array} { c } \text { Slack/ } \\\text { Surplus }\end{array} & \text { Dual Prices } \\\hline 1 & 0 & 75 \\2 & 63 & 0 \\3 & 0 & 25 \\4 & 0 & - 25 \\\hline\end{array} Objective Coefficient Ranges

 Variable  Lower  Limit  Current  Value  Upper  Limit x187.5100 none x2 none 120125x3125150162x4120125150\begin{array}{c|c|c|c}\text { Variable } & \begin{array}{c}\text { Lower } \\\text { Limit }\end{array} & \begin{array}{c}\text { Current } \\\text { Value }\end{array} & \begin{array}{c}\text { Upper } \\\text { Limit }\end{array} \\\hline x_{1} & 87.5 & 100 & \text { none } \\x_{2} & \text { none } & 120 & 125 \\x_{3} & 125 & 150 & 162 \\x_{4} & 120 & 125 & 150\end{array} Right Hand Side Ranges

 Constraint  Lower  Limit  Current  Value  Upper  Limit 1100108123.75257120 none 382558441.55054\begin{array} { c c c c } \text { Constraint } & \begin{array} { c } \text { Lower } \\\text { Limit }\end{array} & \begin{array} { c } \text { Current } \\\text { Value }\end{array} & \begin{array} { c } \text { Upper } \\\text { Limit }\end{array} \\\hline 1 & 100 & 108 & 123.75 \\2 & 57 & 120 & \text { none } \\3 & 8 & 25 & 58 \\4 & 41.5 & 50 & 54 \\\hline\end{array}

-a) To what value can the per bottle profit on red nail polish drop before the solution (product mix) would change?
b) By how much can the per bottle profit on green nail polish increase before the solution (product mix) would change?
Question
Max Z = 5x1 + 3x2
Subject to:  6x1 + 2x2 ? 18
   15x1 + 20x2 ? 60
   x1, x2 ? 0
Determine the sensitivity range for each objective function coefficient.
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-if the company decides to increase the amount of syrup it uses during production of these soft drinks to 990 lbs. will the current product mix change? If show what is the impact on profit?
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-What is the optimal daily profit?
Question
For a maximization problem, assume that a constraint is binding. If the original amount of a resource is 4 lbs. and the range of feasibility (sensitivity range) for this constraint is from 3 lbs. to 6 lbs., increasing the amount of this resource by 1 lb. will result in the

A) same product mix, different total profit.
B) different product mix, same total profit as before.
C) same product mix, same total profit.
D) different product mix, different total profit.
Question
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display. Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX 100x1+120x2+150x3+125x4100 x _ { 1 } + 120 x _ { 2 } + 150 x _ { 3 } + 125 x _ { 4 }
Subject to 1 . x1+2x2+2x3+2x4108x _ { 1 } + 2 x _ { 2 } + 2 x _ { 3 } + 2 x _ { 4 } \leq 108
   2. 3x1+5x2+x41203 x _ { 1 } + 5 x _ { 2 } + x _ { 4 } \leq 120
   3. x1+x325x _ { 1 } + x _ { 3 } \leq 25
   4. x2+x3+x450x _ { 2 } + x _ { 3 } + x _ { 4 } \geq 50
    x1,x2,x3,x40x _ { 1 } , x _ { 2 } , x _ { 3 } , x _ { 4 } \geq 0
Optimal Solution:
Objective Function Value = 7475.000

 Variable  Value  Reduced  Costs x180x205x3170x4330\begin{array} { c | c | c } \text { Variable } & \text { Value } & \begin{array} { c } \text { Reduced } \\\text { Costs }\end{array} \\\hline x _ { 1 } & 8 & 0 \\x _ { 2 } & 0 & 5 \\x _ { 3 } & 17 & 0 \\x _ { 4 } & 33 & 0\end{array}

 Constraint  Slack/  Surplus  Dual Prices 1075263030254025\begin{array} { c c c } \text { Constraint } & \begin{array} { c } \text { Slack/ } \\\text { Surplus }\end{array} & \text { Dual Prices } \\\hline 1 & 0 & 75 \\2 & 63 & 0 \\3 & 0 & 25 \\4 & 0 & - 25 \\\hline\end{array} Objective Coefficient Ranges

 Variable  Lower  Limit  Current  Value  Upper  Limit x187.5100 none x2 none 120125x3125150162x4120125150\begin{array}{c|c|c|c}\text { Variable } & \begin{array}{c}\text { Lower } \\\text { Limit }\end{array} & \begin{array}{c}\text { Current } \\\text { Value }\end{array} & \begin{array}{c}\text { Upper } \\\text { Limit }\end{array} \\\hline x_{1} & 87.5 & 100 & \text { none } \\x_{2} & \text { none } & 120 & 125 \\x_{3} & 125 & 150 & 162 \\x_{4} & 120 & 125 & 150\end{array} Right Hand Side Ranges

 Constraint  Lower  Limit  Current  Value  Upper  Limit 1100108123.75257120 none 382558441.55054\begin{array} { c c c c } \text { Constraint } & \begin{array} { c } \text { Lower } \\\text { Limit }\end{array} & \begin{array} { c } \text { Current } \\\text { Value }\end{array} & \begin{array} { c } \text { Upper } \\\text { Limit }\end{array} \\\hline 1 & 100 & 108 & 123.75 \\2 & 57 & 120 & \text { none } \\3 & 8 & 25 & 58 \\4 & 41.5 & 50 & 54 \\\hline\end{array}

-How much space will be left unused? How many minutes of idle time remain for setting up the display?
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-What is the sensitivity range for the per-case profit of a diet soft drink?
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-How many cases of regular and how many cases of diet soft drink should Whoppy produce to maximize daily profit?
Question
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display. Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX 100x1+120x2+150x3+125x4100 x _ { 1 } + 120 x _ { 2 } + 150 x _ { 3 } + 125 x _ { 4 }
Subject to 1 . x1+2x2+2x3+2x4108x _ { 1 } + 2 x _ { 2 } + 2 x _ { 3 } + 2 x _ { 4 } \leq 108
   2. 3x1+5x2+x41203 x _ { 1 } + 5 x _ { 2 } + x _ { 4 } \leq 120
   3. x1+x325x _ { 1 } + x _ { 3 } \leq 25
   4. x2+x3+x450x _ { 2 } + x _ { 3 } + x _ { 4 } \geq 50
    x1,x2,x3,x40x _ { 1 } , x _ { 2 } , x _ { 3 } , x _ { 4 } \geq 0
Optimal Solution:
Objective Function Value = 7475.000

 Variable  Value  Reduced  Costs x180x205x3170x4330\begin{array} { c | c | c } \text { Variable } & \text { Value } & \begin{array} { c } \text { Reduced } \\\text { Costs }\end{array} \\\hline x _ { 1 } & 8 & 0 \\x _ { 2 } & 0 & 5 \\x _ { 3 } & 17 & 0 \\x _ { 4 } & 33 & 0\end{array}

 Constraint  Slack/  Surplus  Dual Prices 1075263030254025\begin{array} { c c c } \text { Constraint } & \begin{array} { c } \text { Slack/ } \\\text { Surplus }\end{array} & \text { Dual Prices } \\\hline 1 & 0 & 75 \\2 & 63 & 0 \\3 & 0 & 25 \\4 & 0 & - 25 \\\hline\end{array} Objective Coefficient Ranges

 Variable  Lower  Limit  Current  Value  Upper  Limit x187.5100 none x2 none 120125x3125150162x4120125150\begin{array}{c|c|c|c}\text { Variable } & \begin{array}{c}\text { Lower } \\\text { Limit }\end{array} & \begin{array}{c}\text { Current } \\\text { Value }\end{array} & \begin{array}{c}\text { Upper } \\\text { Limit }\end{array} \\\hline x_{1} & 87.5 & 100 & \text { none } \\x_{2} & \text { none } & 120 & 125 \\x_{3} & 125 & 150 & 162 \\x_{4} & 120 & 125 & 150\end{array} Right Hand Side Ranges

 Constraint  Lower  Limit  Current  Value  Upper  Limit 1100108123.75257120 none 382558441.55054\begin{array} { c c c c } \text { Constraint } & \begin{array} { c } \text { Lower } \\\text { Limit }\end{array} & \begin{array} { c } \text { Current } \\\text { Value }\end{array} & \begin{array} { c } \text { Upper } \\\text { Limit }\end{array} \\\hline 1 & 100 & 108 & 123.75 \\2 & 57 & 120 & \text { none } \\3 & 8 & 25 & 58 \\4 & 41.5 & 50 & 54 \\\hline\end{array}

-a) By how much can the amount of space decrease before there is a change in the profit?
b) By how much can the amount of space decrease before there is a change in the product mix?
c) By how much can the amount of time available to set up the display can increase before the solution (product mix) would change?
d) What is the lowest value for the amount of time available to set up the display increase before the solution (product mix) would change?
Question
Max Z = 5x1 + 3x2
Subject to: 6x1 + 2x2 ? 18
   15x1 + 20x2 ? 60
   x1, x2 ? 0
Determine the sensitivity range for each constraint.
Question
The production manager for Beer etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. The manager can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week, respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle.
If the production manager decides to produce of 400 bottles of light beer and 0 bottles of dark beer, it will result in slack of

A) malt only.
B) wheat only.
C) both malt and wheat.
D) neither malt nor wheat.
Question
The production manager for Beer etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. The manager can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week, respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle.
What is the optimal weekly profit?

A) $1000
B) $900
C) $800
D) $700
Question
A plant manager is attempting to determine the production schedule of various products to maximize profit. Assume that a machine hour constraint is binding. If the original amount of machine hours available is 200 minutes., and the range of feasibility is from 130 minutes to 300 minutes, providing two additional machine hours will result in

A) the same product mix, different total profit.
B) a different product mix, same total profit as before.
C) the same product mix, same total profit.
D) a different product mix, different total profit.
Question
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Graphically solve this problem and answer the following questions.
If Mallory Furniture is able to increase the profit per medium shelf to $200, would the company purchase medium shelves? If so, what would be the new product mix and the total profit?
Question
Max Z = 3x1 + 3x2
Subject to : 10x1 + 4x2 ? 60
   25x1 + 50x2 ? 200
   x1, x2 ? 0
Determine the sensitivity range for each objective function coefficient.
Question
The production manager for Beer etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. The manager can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week, respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle.
Which of the following is not a feasible solution?

A) 0 L and 0 D
B) 0 L and 400 D
C) 200 L and 300 D
D) 300 L and 200 D
Question
You are offered the chance to obtain more space. The offer is for 15 units and the total price is $1500. What should you do? Why?
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-What is the sensitivity range of the production time?
Question
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Graphically solve this problem and answer the following questions.
Determine the sensitivity range for the profit on the big shelf.
Question
What combination of x and y is a feasible solution that minimizes the value of the objective function?
Min Z = 3x + 15y
   (1) 2x + 4y ? 12
   (2) 5x + 2y ?10

A) x = 0; y = 3
B) x = 0; y = 5
C) x = 5; y = 0
D) x = 6; y = 0
Question
Given the following linear programming problem:
Max Z = 15x + 20y
S .t.
   8x + 5y ? 40
   4x + y ? 4
What would be the values of x and y that will maximize revenue?

A) x = 5; y = 0
B) x = 0; y = 8
C) x = 0; y = 1
D) x = 1; y = 0.
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular and diet. The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
For the production combination of 135 regular cases and 0 diet cases, which resource is completely used up (at capacity)?

A) only time
B) only syrup
C) time and syrup
D) neither time nor syrup
Question
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-Determine the optimum values for x and y.

A) x = 2; y = 6
B) x = 6; y = 2
C) x = 12; y = 2
D) x = 6; y = 5
Question
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-At the optimal solution, the minimum cost is:

A) $40
B) $50
C) $52
D) $53.33
Question
Given the following linear program that maximizes revenue:
Max Z = 15x + 20y
S )t.
   8x + 5y ? 40
   4x + y ? 4
What is the maximum revenue at the optimal solution?

A) $120
B) $160
C) $185
D) $200
Question
The sensitivity range for the profit on a regular case of soda is

A) $2 to $3.
B) $2 to $4.
C) $1 to $3.
D) $1 to $3.33.
Question
Which of the following could not be a linear programming problem constraint?

A) A + B ≤ -3
B) A - B ≤ -3
C) A - B ≤ 3
D) -A + B ≤ -3
Question
For a maximization problem, the shadow price measures the ________ in the value of the optimal solution, per unit increase for a given ________.

A) decrease, resource
B) increase, parameter
C) improvement, resource
D) decrease, parameter
Question
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular and diet. The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.

-Which of the following is not a feasible production combination?

A) 90 R and 75 D
B) 135 R and 0 D
C) 75 R and 90 D
D) 50 R and 50 D
Question
For the constraints given below, which point is in the feasible region of this minimization problem?
   (1) 14x + 6y ? 42
   (2) x + 3y ? 6

A) x = 2; y = 5
B) x = 1; y = 2
C) x = 2; y = 1
D) x = 2; y = 3
Question
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150.
Which of the following is not a feasible purchase combination?

A) 0 big shelves and 200 medium shelves
B) 0 big shelves and 0 medium shelves
C) 150 big shelves and 0 medium shelves
D) 100 big shelves and 100 medium shelves
Question
For a linear programming problem, assume that a given resource has not been fully used. We can conclude that the shadow price associated with that constraint

A) will have a positive value.
B) will have a negative value.
C) will have a value of zero.
D) could have a positive, negative or a value of zero. (no sign restrictions).
Question
A shadow price reflects which of the following in a maximization problem?

A) the marginal gain in the objective that would be realized by adding one unit of a resource
B) the marginal gain in the objective that would be realized by subtracting one unit of a resource
C) the marginal cost of adding additional resources
D) the marginal gain of selling one more unit
Question
For a resource constraint, either its slack value must be ________ or its shadow price must be ________.

A) negative, negative
B) negative, zero
C) zero, zero
D) zero, negative
Question
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150.
If the Mallory Furniture company decides to purchase 150 big shelves and no medium shelves, which of the two resources will be left over?

A) investment money only
B) storage space only
C) investment money and storage space
D) neither investment money nor storage space
Question
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-What is the sensitivity range for the third constraint, y ? 2?

A) 0 to 4
B) 2 to 5.33
C) 0 to 5.33
D) 4 to 6.33
Question
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-What is the sensitivity range for the cost of x?

A) 0 to 2
B) 4 to 6
C) 2 to 4
D) 0 to 4
Question
Use the constraints given below and determine which of the following points is feasible.
   (1) 14x + 6y ? 42
   (2) x - y ? 3

A) x = 1; y = 4
B) x = 2; y = 8
C) x = 2; y = 4
D) x = 3; y = 0.5
Question
Sensitivity analysis is the analysis of the effect of ________ changes on the ________.

A) price, company
B) cost, production
C) parameter, optimal solution
D) constraint, parameter
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/95
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 3: Linear Programming: Computer Solution and Sensitivity Analysis
1
Sensitivity analysis determines how a change in a parameter affects the optimal solution.
True
2
Most computer linear programming packages readily accept constraints entered in fractional form, such as X1/X3.
False
3
The sensitivity range for an objective function coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.
True
4
The marginal value of any scarce resource is the dollar amount one should be willing to pay for one additional unit of that scarce resource.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
5
Sensitivity ranges can be computed only for the right-hand sides of constraints.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
6
The shadow price for a positive decision variable is 0.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
7
A change in the value of an objective function coefficient will always change the value of the optimal solution.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
8
When the right-hand sides of two constraints are both increased by one unit, the value of the objective function will be adjusted by the sum of the constraints' prices.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
9
Because the management science model requires that parameters are known with certainty, sensitivity analysis is not used in practical, real-world applications of linear programming.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
10
If we change the constraint quantity to a value outside the sensitivity range for that constraint quantity, the shadow price will change.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
11
The terms shadow price and dual price mean the same thing.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
12
For a profit maximization problem, if the allowable increase for a coefficient in the objective function is infinite, then profits are unbounded.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
13
The sensitivity range for a ________ is the range of values over which the quantity values can change without changing the shadow price.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
14
The sensitivity range for a constraint quantity value is the range over which the shadow price is valid.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
15
The sensitivity range for an objective function coefficient is the range of values over which the profit does not change.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
16
The sensitivity range for a constraint quantity value is the range over which the optimal values of the decision variables do not change.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
17
Sensitivity analysis can be used to determine the effect on the solution for changing several parameters at once.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
18
The simplex method is a graphical technique used to solve all management science problems.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
19
The reduced cost (shadow price) for a positive decision variable is ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
20
The accepted sequence for sensitivity analysis is objective function, left-hand side, and right-hand side.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
21
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -What is the shadow price for assembly?

-What is the shadow price for assembly?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
22
The sensitivity range for a constraint quantity value is also the range over which the ________ is valid.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
23
For humanitarian reasons, Taco Loco decides they would rather make product X than product Y. The dollar amount that they can both increase the price of Y and reduce the price of X by to accomplish this reversal of demand is ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
24
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -How many tractors and saws should be produced to maximize profit, and how much profit will they make?

-How many tractors and saws should be produced to maximize profit, and how much profit will they make?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
25
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-If the company wanted to increase the available hours for one of their constraints (assembly, painting, or inspection) by two hours, they should increase ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
26
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management.
Max R = 14Z + 13Y + 17X
subject to:
Beef 2Z + 3Y + 4X ≤ 28
Cheese 9Z + 8Y + 11X ≤ 80
Beans 4Z + 4Y + 2X ≤ 68
X,Y,Z ≥ 0
The sensitivity report from the computer model reads as follows:
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management. Max R = 14Z + 13Y + 17X subject to: Beef 2Z + 3Y + 4X ≤ 28 Cheese 9Z + 8Y + 11X ≤ 80 Beans 4Z + 4Y + 2X ≤ 68 X,Y,Z ≥ 0 The sensitivity report from the computer model reads as follows:   Taco Loco will make the same quantity of X, Y, and Z if the amount of cheese at their disposal is between ________ pounds and ________ pounds.
Taco Loco will make the same quantity of X, Y, and Z if the amount of cheese at their disposal is between ________ pounds and ________ pounds.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
27
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-A change in the market has increased the profit on the super product by $5. Total profit will increase by ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
28
The sensitivity range for a(n) ________ coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
29
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management.
Max R = 14Z + 13Y + 17X
subject to:
Beef 2Z + 3Y + 4X ≤ 28
Cheese 9Z + 8Y + 11X ≤ 80
Beans 4Z + 4Y + 2X ≤ 68
X,Y,Z ≥ 0
The sensitivity report from the computer model reads as follows:
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management. Max R = 14Z + 13Y + 17X subject to: Beef 2Z + 3Y + 4X ≤ 28 Cheese 9Z + 8Y + 11X ≤ 80 Beans 4Z + 4Y + 2X ≤ 68 X,Y,Z ≥ 0 The sensitivity report from the computer model reads as follows:   Taco Loco should produce both ________ but should not make any ________.
Taco Loco should produce both ________ but should not make any ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
30
________ is the analysis of the effect of parameter changes on the optimal solution.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
31
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -What is the shadow price for fabrication?

-What is the shadow price for fabrication?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
32
What is the maximum amount a manager would be willing to pay for one additional hour of machining time?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
33
A breakdown in fabrication causes the available hours to drop from 120 to 90 hours. How will this impact the optimal number of tractors and mowers produced?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
34
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-The profit on the super product could increase by ________ without affecting the product mix.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
35
Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.
 Machine Shop  Fabrication  Assembly  Tractor 2 hours 2 hours 1 hour  Lawn Mower 1 hour 3 hours 0 hour  Hrs. Available 60 hours 120 hours 45 hours \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\\hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\\text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\\text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\\hline\end{array} Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to  2x + y ? 60
    2x + 3y ? 120
    x ? 45



The graphical solution is shown below.
 Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor and $30 on each lawn mower, and they sell all they can produce. The time requirements in the machine shop, fabrication, and tractor assembly are given in the table.  \begin{array} { l l l l } & \text { Machine Shop } & \text { Fabrication } & \text { Assembly } \\ \hline \text { Tractor } & 2 \text { hours } & 2 \text { hours } & 1 \text { hour } \\ \text { Lawn Mower } & 1 \text { hour } & 3 \text { hours } & 0 \text { hour } \\ \text { Hrs. Available } & 60 \text { hours } & 120 \text { hours } & 45 \text { hours } \\ \hline \end{array}  Formulation: Let x = number of tractors produced per period y = number of lawn mowers produced per period Let 	x = number of tractors produced per period 	y = number of lawn mowers produced per period MAX 30x + 30y subject to  2x + y	? 60 	     2x + 3y	? 120 	    x ? 45    The graphical solution is shown below.    -Determine the sensitivity range for the profit for tractors.

-Determine the sensitivity range for the profit for tractors.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
36
If Taco Loco reduces the price of the X product by about 82 cents, then their optimal product mix will contain ________ X.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
37
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-The optimal number of regular products to produce is ________, and the optimal number of super products to produce is ________, for total profits of ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
38
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management.
Max R = 14Z + 13Y + 17X
subject to:
Beef 2Z + 3Y + 4X ≤ 28
Cheese 9Z + 8Y + 11X ≤ 80
Beans 4Z + 4Y + 2X ≤ 68
X,Y,Z ≥ 0
The sensitivity report from the computer model reads as follows:
Taco Loco is considering a new addition to their menu. They have test marketed a number of possibilities and narrowed them down to three new products, X, Y, and Z. Each of these products is made from a different combination of beef, beans, and cheese, and each product has a price point. Taco Loco feels they can sell an X for $17, a Y for $13, and a Z for $14. The company's management science consultant formulates the following linear programming model for company management. Max R = 14Z + 13Y + 17X subject to: Beef 2Z + 3Y + 4X ≤ 28 Cheese 9Z + 8Y + 11X ≤ 80 Beans 4Z + 4Y + 2X ≤ 68 X,Y,Z ≥ 0 The sensitivity report from the computer model reads as follows:   Taco Loco should try to purchase additional ________, but should not buy more ________.
Taco Loco should try to purchase additional ________, but should not buy more ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
39
What is the range for the shadow price for assembly?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
40
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R + 75S
s.t.
   1.2 R + 1.6 S ? 600 assembly (hours)
   0.8 R + 0.5 S ? 300 paint (hours)
.   16 R + 0.4 S ? 100 inspection (hours)
Sensitivity Report:
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$7 Regular =291.670.00507020 $C $7 Super =133.330.00755043.75\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 7 & \text { Regular }= & 291.67 & 0.00 & 50 & 70 & 20 \\\hline \text { \$C } \$ 7 & \text { Super }= & 133.33 & 0.00 & 75 & 50 & 43.75 \\\hline\end{array}



 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Assembly (hr/unit) 563.330.0C6001$E+3036.67$E$4 Paint (hr/unit) 300.0033.3330039.29175$E$5 Inspect (hr/unit) 100.00145.8310012.9440\begin{array}{llrccc}\text { Cell } \quad \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{E} \$ 3 \text { Assembly (hr/unit) } & 563.33 & 0.0 \mathrm{C} & 600 & 1 \$\mathrm{E}+30 & 36.67 \\\hline \$\mathrm{E} \$ 4 \text { Paint (hr/unit) } & 300.00 & 33.33 & 300 & 39.29 & 175 \\\hline \$\mathrm{E} \$ 5 \text { Inspect (hr/unit) } & 100.00 & 145.83 & 100 & 12.94 & 40\end{array}

-If downtime reduced the available capacity for painting by 40 hours (from 300 to 260 hours), profits would be reduced by ________.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
41
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Graphically solve this problem and answer the following questions.
What is the optimal product mix and maximum profit?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
42
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display. Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX 100x1+120x2+150x3+125x4100 x _ { 1 } + 120 x _ { 2 } + 150 x _ { 3 } + 125 x _ { 4 }
Subject to 1 . x1+2x2+2x3+2x4108x _ { 1 } + 2 x _ { 2 } + 2 x _ { 3 } + 2 x _ { 4 } \leq 108
   2. 3x1+5x2+x41203 x _ { 1 } + 5 x _ { 2 } + x _ { 4 } \leq 120
   3. x1+x325x _ { 1 } + x _ { 3 } \leq 25
   4. x2+x3+x450x _ { 2 } + x _ { 3 } + x _ { 4 } \geq 50
    x1,x2,x3,x40x _ { 1 } , x _ { 2 } , x _ { 3 } , x _ { 4 } \geq 0
Optimal Solution:
Objective Function Value = 7475.000

 Variable  Value  Reduced  Costs x180x205x3170x4330\begin{array} { c | c | c } \text { Variable } & \text { Value } & \begin{array} { c } \text { Reduced } \\\text { Costs }\end{array} \\\hline x _ { 1 } & 8 & 0 \\x _ { 2 } & 0 & 5 \\x _ { 3 } & 17 & 0 \\x _ { 4 } & 33 & 0\end{array}

 Constraint  Slack/  Surplus  Dual Prices 1075263030254025\begin{array} { c c c } \text { Constraint } & \begin{array} { c } \text { Slack/ } \\\text { Surplus }\end{array} & \text { Dual Prices } \\\hline 1 & 0 & 75 \\2 & 63 & 0 \\3 & 0 & 25 \\4 & 0 & - 25 \\\hline\end{array} Objective Coefficient Ranges

 Variable  Lower  Limit  Current  Value  Upper  Limit x187.5100 none x2 none 120125x3125150162x4120125150\begin{array}{c|c|c|c}\text { Variable } & \begin{array}{c}\text { Lower } \\\text { Limit }\end{array} & \begin{array}{c}\text { Current } \\\text { Value }\end{array} & \begin{array}{c}\text { Upper } \\\text { Limit }\end{array} \\\hline x_{1} & 87.5 & 100 & \text { none } \\x_{2} & \text { none } & 120 & 125 \\x_{3} & 125 & 150 & 162 \\x_{4} & 120 & 125 & 150\end{array} Right Hand Side Ranges

 Constraint  Lower  Limit  Current  Value  Upper  Limit 1100108123.75257120 none 382558441.55054\begin{array} { c c c c } \text { Constraint } & \begin{array} { c } \text { Lower } \\\text { Limit }\end{array} & \begin{array} { c } \text { Current } \\\text { Value }\end{array} & \begin{array} { c } \text { Upper } \\\text { Limit }\end{array} \\\hline 1 & 100 & 108 & 123.75 \\2 & 57 & 120 & \text { none } \\3 & 8 & 25 & 58 \\4 & 41.5 & 50 & 54 \\\hline\end{array}

-a) To what value can the per bottle profit on red nail polish drop before the solution (product mix) would change?
b) By how much can the per bottle profit on green nail polish increase before the solution (product mix) would change?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
43
Max Z = 5x1 + 3x2
Subject to:  6x1 + 2x2 ? 18
   15x1 + 20x2 ? 60
   x1, x2 ? 0
Determine the sensitivity range for each objective function coefficient.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
44
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-if the company decides to increase the amount of syrup it uses during production of these soft drinks to 990 lbs. will the current product mix change? If show what is the impact on profit?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
45
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-What is the optimal daily profit?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
46
For a maximization problem, assume that a constraint is binding. If the original amount of a resource is 4 lbs. and the range of feasibility (sensitivity range) for this constraint is from 3 lbs. to 6 lbs., increasing the amount of this resource by 1 lb. will result in the

A) same product mix, different total profit.
B) different product mix, same total profit as before.
C) same product mix, same total profit.
D) different product mix, different total profit.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
47
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display. Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX 100x1+120x2+150x3+125x4100 x _ { 1 } + 120 x _ { 2 } + 150 x _ { 3 } + 125 x _ { 4 }
Subject to 1 . x1+2x2+2x3+2x4108x _ { 1 } + 2 x _ { 2 } + 2 x _ { 3 } + 2 x _ { 4 } \leq 108
   2. 3x1+5x2+x41203 x _ { 1 } + 5 x _ { 2 } + x _ { 4 } \leq 120
   3. x1+x325x _ { 1 } + x _ { 3 } \leq 25
   4. x2+x3+x450x _ { 2 } + x _ { 3 } + x _ { 4 } \geq 50
    x1,x2,x3,x40x _ { 1 } , x _ { 2 } , x _ { 3 } , x _ { 4 } \geq 0
Optimal Solution:
Objective Function Value = 7475.000

 Variable  Value  Reduced  Costs x180x205x3170x4330\begin{array} { c | c | c } \text { Variable } & \text { Value } & \begin{array} { c } \text { Reduced } \\\text { Costs }\end{array} \\\hline x _ { 1 } & 8 & 0 \\x _ { 2 } & 0 & 5 \\x _ { 3 } & 17 & 0 \\x _ { 4 } & 33 & 0\end{array}

 Constraint  Slack/  Surplus  Dual Prices 1075263030254025\begin{array} { c c c } \text { Constraint } & \begin{array} { c } \text { Slack/ } \\\text { Surplus }\end{array} & \text { Dual Prices } \\\hline 1 & 0 & 75 \\2 & 63 & 0 \\3 & 0 & 25 \\4 & 0 & - 25 \\\hline\end{array} Objective Coefficient Ranges

 Variable  Lower  Limit  Current  Value  Upper  Limit x187.5100 none x2 none 120125x3125150162x4120125150\begin{array}{c|c|c|c}\text { Variable } & \begin{array}{c}\text { Lower } \\\text { Limit }\end{array} & \begin{array}{c}\text { Current } \\\text { Value }\end{array} & \begin{array}{c}\text { Upper } \\\text { Limit }\end{array} \\\hline x_{1} & 87.5 & 100 & \text { none } \\x_{2} & \text { none } & 120 & 125 \\x_{3} & 125 & 150 & 162 \\x_{4} & 120 & 125 & 150\end{array} Right Hand Side Ranges

 Constraint  Lower  Limit  Current  Value  Upper  Limit 1100108123.75257120 none 382558441.55054\begin{array} { c c c c } \text { Constraint } & \begin{array} { c } \text { Lower } \\\text { Limit }\end{array} & \begin{array} { c } \text { Current } \\\text { Value }\end{array} & \begin{array} { c } \text { Upper } \\\text { Limit }\end{array} \\\hline 1 & 100 & 108 & 123.75 \\2 & 57 & 120 & \text { none } \\3 & 8 & 25 & 58 \\4 & 41.5 & 50 & 54 \\\hline\end{array}

-How much space will be left unused? How many minutes of idle time remain for setting up the display?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
48
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-What is the sensitivity range for the per-case profit of a diet soft drink?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
49
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-How many cases of regular and how many cases of diet soft drink should Whoppy produce to maximize daily profit?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
50
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display. Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX 100x1+120x2+150x3+125x4100 x _ { 1 } + 120 x _ { 2 } + 150 x _ { 3 } + 125 x _ { 4 }
Subject to 1 . x1+2x2+2x3+2x4108x _ { 1 } + 2 x _ { 2 } + 2 x _ { 3 } + 2 x _ { 4 } \leq 108
   2. 3x1+5x2+x41203 x _ { 1 } + 5 x _ { 2 } + x _ { 4 } \leq 120
   3. x1+x325x _ { 1 } + x _ { 3 } \leq 25
   4. x2+x3+x450x _ { 2 } + x _ { 3 } + x _ { 4 } \geq 50
    x1,x2,x3,x40x _ { 1 } , x _ { 2 } , x _ { 3 } , x _ { 4 } \geq 0
Optimal Solution:
Objective Function Value = 7475.000

 Variable  Value  Reduced  Costs x180x205x3170x4330\begin{array} { c | c | c } \text { Variable } & \text { Value } & \begin{array} { c } \text { Reduced } \\\text { Costs }\end{array} \\\hline x _ { 1 } & 8 & 0 \\x _ { 2 } & 0 & 5 \\x _ { 3 } & 17 & 0 \\x _ { 4 } & 33 & 0\end{array}

 Constraint  Slack/  Surplus  Dual Prices 1075263030254025\begin{array} { c c c } \text { Constraint } & \begin{array} { c } \text { Slack/ } \\\text { Surplus }\end{array} & \text { Dual Prices } \\\hline 1 & 0 & 75 \\2 & 63 & 0 \\3 & 0 & 25 \\4 & 0 & - 25 \\\hline\end{array} Objective Coefficient Ranges

 Variable  Lower  Limit  Current  Value  Upper  Limit x187.5100 none x2 none 120125x3125150162x4120125150\begin{array}{c|c|c|c}\text { Variable } & \begin{array}{c}\text { Lower } \\\text { Limit }\end{array} & \begin{array}{c}\text { Current } \\\text { Value }\end{array} & \begin{array}{c}\text { Upper } \\\text { Limit }\end{array} \\\hline x_{1} & 87.5 & 100 & \text { none } \\x_{2} & \text { none } & 120 & 125 \\x_{3} & 125 & 150 & 162 \\x_{4} & 120 & 125 & 150\end{array} Right Hand Side Ranges

 Constraint  Lower  Limit  Current  Value  Upper  Limit 1100108123.75257120 none 382558441.55054\begin{array} { c c c c } \text { Constraint } & \begin{array} { c } \text { Lower } \\\text { Limit }\end{array} & \begin{array} { c } \text { Current } \\\text { Value }\end{array} & \begin{array} { c } \text { Upper } \\\text { Limit }\end{array} \\\hline 1 & 100 & 108 & 123.75 \\2 & 57 & 120 & \text { none } \\3 & 8 & 25 & 58 \\4 & 41.5 & 50 & 54 \\\hline\end{array}

-a) By how much can the amount of space decrease before there is a change in the profit?
b) By how much can the amount of space decrease before there is a change in the product mix?
c) By how much can the amount of time available to set up the display can increase before the solution (product mix) would change?
d) What is the lowest value for the amount of time available to set up the display increase before the solution (product mix) would change?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
51
Max Z = 5x1 + 3x2
Subject to: 6x1 + 2x2 ? 18
   15x1 + 20x2 ? 60
   x1, x2 ? 0
Determine the sensitivity range for each constraint.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
52
The production manager for Beer etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. The manager can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week, respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle.
If the production manager decides to produce of 400 bottles of light beer and 0 bottles of dark beer, it will result in slack of

A) malt only.
B) wheat only.
C) both malt and wheat.
D) neither malt nor wheat.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
53
The production manager for Beer etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. The manager can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week, respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle.
What is the optimal weekly profit?

A) $1000
B) $900
C) $800
D) $700
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
54
A plant manager is attempting to determine the production schedule of various products to maximize profit. Assume that a machine hour constraint is binding. If the original amount of machine hours available is 200 minutes., and the range of feasibility is from 130 minutes to 300 minutes, providing two additional machine hours will result in

A) the same product mix, different total profit.
B) a different product mix, same total profit as before.
C) the same product mix, same total profit.
D) a different product mix, different total profit.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
55
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Graphically solve this problem and answer the following questions.
If Mallory Furniture is able to increase the profit per medium shelf to $200, would the company purchase medium shelves? If so, what would be the new product mix and the total profit?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
56
Max Z = 3x1 + 3x2
Subject to : 10x1 + 4x2 ? 60
   25x1 + 50x2 ? 200
   x1, x2 ? 0
Determine the sensitivity range for each objective function coefficient.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
57
The production manager for Beer etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. The manager can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week, respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle.
Which of the following is not a feasible solution?

A) 0 L and 0 D
B) 0 L and 400 D
C) 200 L and 300 D
D) 300 L and 200 D
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
58
You are offered the chance to obtain more space. The offer is for 15 units and the total price is $1500. What should you do? Why?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
59
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular (R) and diet (D). The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
The formulation for this problem is given below.
MAX Z = $3R + $2D
s.t.
   2R + 4D ? 480
   5R + 3D ? 675
The sensitivity report is given below.
Adjustable Cells
 Cell  Name  Final  Value  Reduced  Cost  Objective  Coefficient  Allowable  Increase  Allowable  Decrease $ B$6 Regular =90.000.0030.332$C$6 Diet =75.000.00240.2\begin{array}{lcccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Reduced } \\\text { Cost }\end{array} & \begin{array}{c}\text { Objective } \\\text { Coefficient }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline \$ \mathrm{~B} \$ 6 && \text { Regular }=90.00 & 0.00 & 3 & 0.33 & 2 \\\hline \$ \mathrm{C} \$ 6 && \text { Diet }=75.00 & 0.00 & 2 & 4 & 0.2 \\\hline\end{array} Constraints
 Cell  Name  Final  Value  Shadow  Price  Constraint  R.H. Side  Allowable  Increase  Allowable  Decrease $E$3 Production (minutes) 480.000.07480420210$ E $4 Syrup (gallons) 675.000.57675525315\begin{array}{ccccccc}\text { Cell } & \text { Name } & \begin{array}{c}\text { Final } \\\text { Value }\end{array} & \begin{array}{c}\text { Shadow } \\\text { Price }\end{array} & \begin{array}{c}\text { Constraint } \\\text { R.H. Side }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Increase }\end{array} & \begin{array}{c}\text { Allowable } \\\text { Decrease }\end{array} \\\hline\$ \mathrm{E} \$ 3 & \text { Production (minutes) } & 480.00 & 0.07 & 480 & 420 & 210 \\\hline \$\text { E } \$ 4 & \text { Syrup (gallons) } & 675.00 & 0.57 & 675 & 525 & 315 \\\hline\end{array}

-What is the sensitivity range of the production time?
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
60
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Graphically solve this problem and answer the following questions.
Determine the sensitivity range for the profit on the big shelf.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
61
What combination of x and y is a feasible solution that minimizes the value of the objective function?
Min Z = 3x + 15y
   (1) 2x + 4y ? 12
   (2) 5x + 2y ?10

A) x = 0; y = 3
B) x = 0; y = 5
C) x = 5; y = 0
D) x = 6; y = 0
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
62
Given the following linear programming problem:
Max Z = 15x + 20y
S .t.
   8x + 5y ? 40
   4x + y ? 4
What would be the values of x and y that will maximize revenue?

A) x = 5; y = 0
B) x = 0; y = 8
C) x = 0; y = 1
D) x = 1; y = 0.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
63
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular and diet. The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.
For the production combination of 135 regular cases and 0 diet cases, which resource is completely used up (at capacity)?

A) only time
B) only syrup
C) time and syrup
D) neither time nor syrup
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
64
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-Determine the optimum values for x and y.

A) x = 2; y = 6
B) x = 6; y = 2
C) x = 12; y = 2
D) x = 6; y = 5
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
65
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-At the optimal solution, the minimum cost is:

A) $40
B) $50
C) $52
D) $53.33
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
66
Given the following linear program that maximizes revenue:
Max Z = 15x + 20y
S )t.
   8x + 5y ? 40
   4x + y ? 4
What is the maximum revenue at the optimal solution?

A) $120
B) $160
C) $185
D) $200
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
67
The sensitivity range for the profit on a regular case of soda is

A) $2 to $3.
B) $2 to $4.
C) $1 to $3.
D) $1 to $3.33.
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
68
Which of the following could not be a linear programming problem constraint?

A) A + B ≤ -3
B) A - B ≤ -3
C) A - B ≤ 3
D) -A + B ≤ -3
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
69
For a maximization problem, the shadow price measures the ________ in the value of the optimal solution, per unit increase for a given ________.

A) decrease, resource
B) increase, parameter
C) improvement, resource
D) decrease, parameter
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
70
The production manager for the Whoppy soft drink company is considering the production of two kinds of soft drinks: regular and diet. The company operates one 8-hour shift per day. Therefore, the production time is 480 minutes per day. During the production process, one of the main ingredients, syrup, is limited to maximum production capacity of 675 gallons per day. Production of a regular case requires 2 minutes and 5 gallons of syrup, while production of a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case.

-Which of the following is not a feasible production combination?

A) 90 R and 75 D
B) 135 R and 0 D
C) 75 R and 90 D
D) 50 R and 50 D
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
71
For the constraints given below, which point is in the feasible region of this minimization problem?
   (1) 14x + 6y ? 42
   (2) x + 3y ? 6

A) x = 2; y = 5
B) x = 1; y = 2
C) x = 2; y = 1
D) x = 2; y = 3
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
72
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150.
Which of the following is not a feasible purchase combination?

A) 0 big shelves and 200 medium shelves
B) 0 big shelves and 0 medium shelves
C) 150 big shelves and 0 medium shelves
D) 100 big shelves and 100 medium shelves
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
73
For a linear programming problem, assume that a given resource has not been fully used. We can conclude that the shadow price associated with that constraint

A) will have a positive value.
B) will have a negative value.
C) will have a value of zero.
D) could have a positive, negative or a value of zero. (no sign restrictions).
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
74
A shadow price reflects which of the following in a maximization problem?

A) the marginal gain in the objective that would be realized by adding one unit of a resource
B) the marginal gain in the objective that would be realized by subtracting one unit of a resource
C) the marginal cost of adding additional resources
D) the marginal gain of selling one more unit
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
75
For a resource constraint, either its slack value must be ________ or its shadow price must be ________.

A) negative, negative
B) negative, zero
C) zero, zero
D) zero, negative
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
76
Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150.
If the Mallory Furniture company decides to purchase 150 big shelves and no medium shelves, which of the two resources will be left over?

A) investment money only
B) storage space only
C) investment money and storage space
D) neither investment money nor storage space
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
77
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-What is the sensitivity range for the third constraint, y ? 2?

A) 0 to 4
B) 2 to 5.33
C) 0 to 5.33
D) 4 to 6.33
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
78
Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
      (2) 2x + 4y ? 32
      (3) y ? 2

-What is the sensitivity range for the cost of x?

A) 0 to 2
B) 4 to 6
C) 2 to 4
D) 0 to 4
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
79
Use the constraints given below and determine which of the following points is feasible.
   (1) 14x + 6y ? 42
   (2) x - y ? 3

A) x = 1; y = 4
B) x = 2; y = 8
C) x = 2; y = 4
D) x = 3; y = 0.5
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
80
Sensitivity analysis is the analysis of the effect of ________ changes on the ________.

A) price, company
B) cost, production
C) parameter, optimal solution
D) constraint, parameter
Unlock Deck
Unlock for access to all 95 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 95 flashcards in this deck.