Deck 2: Linear Programming Models: Graphical and Computer Methods

Full screen (f)
exit full mode
Question
Unbounded linear programming problems typically arise as a result of misformulation.
Use Space or
up arrow
down arrow
to flip the card.
Question
Consider the following linear programming model
Max2X1+3X2 Subject to: X1+X24X12X1,X20\begin{array} { l l } \operatorname { Max } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \geq 4 \\& \mathrm { X } _ { 1 } \geq 2 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
This linear programming model has:

A)redundant constraints
B)infeasible solution
C)alternate optimal solution
D)unique solution
E)unbounded solution
Question
If an isoprofit line can be moved outward such that the objective function value can be made to reach infinity,then this problem has an unbounded solution.
Question
A redundant constraint is eliminated from a linear programming model.What effect will this have on the optimal solution?

A)feasible region will decrease in size
B)feasible region will increase in size
C)a decrease in objective function value
D)an increase in objective function value
E)no change
Question
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.What formula should be entered in cell D9 to compute the amount of resource 2 that is consumed?</strong> A)=B9*D9 + C9*D9 B)=SUMPRODUCT(B2:C2,B9:C9) C)=SUM(B9:C9) D)=SUMPRODUCT(B3:C3,B9:C9) E)=SUMPRODUCT(B9:C9,B5:C5) <div style=padding-top: 35px>
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.What formula should be entered in cell D9 to compute the amount of resource 2 that is consumed?

A)=B9*D9 + C9*D9
B)=SUMPRODUCT(B2:C2,B9:C9)
C)=SUM(B9:C9)
D)=SUMPRODUCT(B3:C3,B9:C9)
E)=SUMPRODUCT(B9:C9,B5:C5)
Question
Consider the following linear programming model:
Min2X1+3X2 Subject to: X1+2X21X21X10,X20\begin{array} { l l } \operatorname { Min } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } \\& \mathrm { X } _ { 1 } + 2 \mathrm { X } _ { 2 } \leq 1 \\& \mathrm { X } _ { 2 } \leq 1 \\& \mathrm { X } _ { 1 } \geq 0 , \mathrm { X } _ { 2 } \leq 0\end{array}
This problem violates which of the following assumptions?

A)additivity
B)divisibility
C)non-negativity
D)proportionality
E)linearity
Question
The constraint for a given resource is given by the following equation:
2X₁ + 3X₂ ≥ 20
If X₁ = 5 and X₂ = 4 how many units of this resource are unused?

A)20
B)2
C)22
D)0
E)9
Question
The constraint for a given resource is given by the following equation:
2X₁ + 3X₂ ≤ 20
If X₁ = 5 and X₂ = 3,how many units of this resource are unused?

A)20
B)19
C)1
D)0
E)17
Question
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.What cell reference designates the Target Cell in Solver?</strong> A)E4 B)B3 C)C3 D)D8:D10 E)E8:E10 <div style=padding-top: 35px>
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.What cell reference designates the Target Cell in "Solver"?

A)E4
B)B3
C)C3
D)D8:D10
E)E8:E10
Question
Consider the following linear programming model:
Max2X1+3X2 Subject to: X12X23X11X1,X20\begin{array} { l l } \operatorname { Max } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& \mathrm { X } _ { 1 } \leq 2 \\& \mathrm { X } _ { 2 } \leq 3 \\& \mathrm { X } _ { 1 } \leq 1 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
This linear programming model has:

A)alternate optimal solutions
B)unbounded solution
C)redundant constraint
D)infeasible solution
E)non-negative solution
Question
Consider the following linear programming model:  Max X12+X2+3X3 Subject to: X1+X23X1+X21X1,X20\begin{array} { l } \text { Max } \quad \mathrm { X } _ { 1 } ^ { 2 } + \mathrm { X } _ { 2 } + 3 \mathrm { X } _ { 3 } \\\text { Subject to: } \\\qquad \begin{array} { l } \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 3 \\\mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 1 \\\mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}\end{array}
This problem violates which of the following assumptions?

A)certainty
B)proportionality
C)divisibility
D)linearity
E)integrality
Question
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.What formula should be entered in cell E4 to compute total profitability?</strong> A)=SUMPRODUCT(B5:C5,B2:C2) B)=SUM(B3:C3) C)=B2*B5 + C2*C5 D)=SUMPRODUCT(B5:C5,E8:E10) E)=B3*B5 + C3*C5 <div style=padding-top: 35px>
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.What formula should be entered in cell E4 to compute total profitability?

A)=SUMPRODUCT(B5:C5,B2:C2)
B)=SUM(B3:C3)
C)=B2*B5 + C2*C5
D)=SUMPRODUCT(B5:C5,E8:E10)
E)=B3*B5 + C3*C5
Question
Consider the following linear programming model
This linear programming model has:
Min2X1+3X2 Subject to: X1+X24X12X1,X20\begin{array} { l l } \operatorname { Min } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \geq 4 \\& \mathrm { X } _ { 1 } \geq 2 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}

A)unique optimal solution
B)unbounded solution
C)infeasible solution
D)alternate optimal solution
E)redundant constraints
Question
If a linear programming problem has alternate optimal solutions,then the objective function value will vary according to each alternate optimal point.
Question
A linear programming model generates an optimal solution with fractional values.This solution satisfies which basic linear programming assumption?

A)certainty
B)divisibility
C)proportionality
D)linearity
E)non-negativity
Question
________ follows a path of points inside the feasible region to find an optimal solution.

A)The graphical approach
B)The simplex method
C)Karmarkar's method
D)Trial-and-error
E)none of the above
Question
________ systematically examines corner points,using algebraic steps,until an optimal solution is found.

A)The graphical approach
B)The simplex method
C)Karmarkar's method
D)Trial-and-error
E)none of the above
Question
"Solver" typically generates which of the following report(s)?

A)answer report
B)sensitivity analysis report
C)limits report
D)A and B only
E)A,B,and C
Question
Consider the following linear programming model:
MaxX1+X2 Subject to: X1+X22X11X23X1,X20\begin{array} { l l } \operatorname { Max } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 2 \\& \mathrm { X } _ { 1 } \geq 1 \\& \mathrm { X } _ { 2 } \geq 3 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
This linear programming model has:

A)alternate optimal solution
B)unbounded solution
C)redundant constraint
D)infeasible solution
E)unique solution
Question
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.Which cell(s)are the Changing Cells as designated by Solver?</strong> A)E4 B)B2:C2 C)B3:C3 D)D8:D10 E)B5:C5 <div style=padding-top: 35px>
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.Which cell(s)are the Changing Cells as designated by "Solver"?

A)E4
B)B2:C2
C)B3:C3
D)D8:D10
E)B5:C5
Question
A linear programming model has the following objective function:
Max: X₁² + 3X₂ + 4X₃.This model violates a key linear programming model assumption.
Question
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.<div style=padding-top: 35px>
Use Solver to find the optimal values of X₁ and X₂.
Question
Linear programming models typically do not have coefficients (i.e. ,objective function or constraint coefficients)that assume random values.
Question
If a redundant constraint is eliminated from a linear programming model,this will have an impact on the optimal solution.
Question
When using Solver,the parameter Changing Cells is typically associated with the objective function.
Question
An ice cream shop sells single scoop ice cream cones that come in three flavors: chocolate only,vanilla only,and chocolate-vanilla twist.The cones are prepackaged and sold to a supermarket daily.The ingredients used along with the minimum demand of each flavor are shown as follows:
An ice cream shop sells single scoop ice cream cones that come in three flavors: chocolate only,vanilla only,and chocolate-vanilla twist.The cones are prepackaged and sold to a supermarket daily.The ingredients used along with the minimum demand of each flavor are shown as follows:   Each day,40 pounds of chocolate and 38 pounds of vanilla are supplied to the ice cream shop from an outside vendor.The chocolate,vanilla,and chocolate-vanilla twist each yield a profit of $2.00,$2.50,and $3.00 per cone,respectively.How many chocolate,vanilla,and chocolate-vanilla twist cones must prepackage daily to maximize daily profits?<div style=padding-top: 35px>
Each day,40 pounds of chocolate and 38 pounds of vanilla are supplied to the ice cream shop from an outside vendor.The chocolate,vanilla,and chocolate-vanilla twist each yield a profit of $2.00,$2.50,and $3.00 per cone,respectively.How many chocolate,vanilla,and chocolate-vanilla twist cones must prepackage daily to maximize daily profits?
Question
Creatine and protein are common supplements in most bodybuilding products.Bodyworks,a nutrition health store,makes a powder supplement that combines creatine and protein from two ingredients (X₁ and X₂).Ingredient X₁ provides 20 grams of protein and 5 grams of creatine per pound.Ingredient X₂ provides 15 grams of protein and 3 grams of creatine per pound.Ingredients X₁ and X₂ cost Bodyworks $5 and $7 per pound,respectively.Bodyworks wants its supplement to contain at least 30 grams of protein and 10 grams of creatine per pound and be produced at the least cost.
Determine what combination will maximize profits.
Question
A linear programming model has the following two constraints: X₁ ≥ 3 and X₁ ≥ 4.This model has a redundant constraint.
Question
A furniture store produces beds and desks for college students.The production process requires assembly and painting.Each bed requires 6 hours of assembly and 4 hours of painting.Each desk requires 4 hours of assembly and 8 hours of painting.There are 40 hours of assembly time and 45 hours of painting time available each week.Each bed generates $35 of profit and each desk generates $45 of profit.As a result of a labor strike,the furniture store is limited to producing at most 8 beds each week.Determine how many beds and desks should be produced each week to maximize weekly profits.
Question
In a product mix problem,a decision maker has limited availability of weekly labor hours.Labor hours would most likely constitute a decision variable rather than a constraint.
Question
A computer retail store sells two types of flat screen monitors: 17 inches and 19 inches,with a profit contribution of $300 and $250,respectively.The monitors are ordered each week from an outside supplier.As an added feature,the retail store installs on each monitor a privacy filter that narrows the viewing angle so that only persons sitting directly in front of the monitor are able to see on-screen data.Each 19" monitor consumes about 30 minutes of installation time,while each 17" monitor requires about 10 minutes of installation time.The retail store has approximately 40 hours of labor time available each week.The total combined demand for both monitors is at least 40 monitors each week.How many units of each monitor should the retail store order each week to maximize its weekly profits and meet its weekly demand?
Question
The simplex method is an algebraic solution procedure for a linear programming problem.
Question
It is possible to solve graphically a linear programming model with 4 decision variables.
Question
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.<div style=padding-top: 35px>
Use Solver to find the optimal values of X₁ and X₂.
Question
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.<div style=padding-top: 35px>
Use Solver to find the optimal values of X₁ and X₂.
Question
Karmarkar's method is synonymous with the corner point method.
Question
An isoprofit line represents a line whereby all profits are the same along the line.
Question
It is possible for a linear programming model to yield an optimal solution that has fractional values.
Question
A linear programming problem has the following two constraints: X₁ ≤ 20 and X₁ ≥ 25.This problem is infeasible.
Question
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.<div style=padding-top: 35px>
Use Solver to find the optimal values of X₁ and X₂.
Question
A company that is introducing a new product would like to generate maximum market exposure.The marketing department currently has $100,000 of advertising budget for the year and is considering placing ads in three media: radio,television,and newspapers.The cost per ad and the exposure rating are as follows:
A company that is introducing a new product would like to generate maximum market exposure.The marketing department currently has $100,000 of advertising budget for the year and is considering placing ads in three media: radio,television,and newspapers.The cost per ad and the exposure rating are as follows:   The marketing department would like to place twice as many radio ads as television ads.They also would like to place at least 4 ads in each advertising media.What is the optimal allocation to each advertising medium to maximize audience exposure?<div style=padding-top: 35px>
The marketing department would like to place twice as many radio ads as television ads.They also would like to place at least 4 ads in each advertising media.What is the optimal allocation to each advertising medium to maximize audience exposure?
Question
A bank is attempting to determine where its assets should be allocated in order to maximize its annual return.At present,$750,000 is available for investment in three types of mutual funds: A,B,and C.The annual rate of return on each type of fund is as follows: fund A,15%;fund B,12%;fund C;13%.The bank's manager has placed the following restrictions on the bank's portfolio:
• No more than 20% of the total amount invested may be in fund A.
• The amount invested in fund B cannot exceed the amount invested in fund C.
Determine the optimal allocation that maximizes the bank's annual return.
Question
A meat packing store produces a dog food mixture that is sold to pet retail outlets in bags of 10 pounds each.The food mixture contains the ingredients turkey and beef.The cost per pound of each of these ingredients is as follows:
A meat packing store produces a dog food mixture that is sold to pet retail outlets in bags of 10 pounds each.The food mixture contains the ingredients turkey and beef.The cost per pound of each of these ingredients is as follows:   Each bag must contain at least 5 pounds of turkey.Moreover,the ratio of turkey to beef must be at least 2 to 1.What is the optimal mixture of the ingredients that will minimize total cost?<div style=padding-top: 35px>
Each bag must contain at least 5 pounds of turkey.Moreover,the ratio of turkey to beef must be at least 2 to 1.What is the optimal mixture of the ingredients that will minimize total cost?
Question
A company can decide how many additional labor hours to acquire for a given week.Subcontractors will only work a maximum of 20 hours a week.The company must produce at least 200 units of product A,300 units of product B,and 400 units of product C.In 1 hour of work,worker 1 can produce 15 units of product A,10 units of product B,and 30 units of product C.Worker 2 can produce 5 units of product B,20 units of product B,and 35 units of product C.Worker 3 can produce 20 units of product A,15 units of product B,and 25 units of product C.Worker 1 demands a salary of $50/hr,worker 2 demands a salary of $40/hr,and worker 3 demands a salary of $45/hr.The company must choose how many hours they should hire from each worker to meet their production requirements and minimize labor cost.
Question
Suppose that a farmer has 5 acres of land that can be planted with either wheat,corn,or a combination of the two.To ensure a healthy crop,a fertilizer and an insecticide must be applied at the beginning of the season before harvesting.The farmer currently has 100 pounds of the fertilizer and 150 pounds of the insecticide at the beginning of the season.Each acre of wheat planted requires 10 pounds of the fertilizer and 12 pounds of the insecticide.Each acre of corn planted requires 13 pounds of the fertilizer and 11 pounds of the insecticide.Each acre of wheat harvested yields a profit of $600,while each acre of corn harvested yields $750 in profit.What is the optimal allocation for the crops that maximizes the farmer's profit?
Question
A carpenter makes tables and chairs.Each table can be sold for a profit of $50 and each chair for a profit of $30.The carpenter works a maximum of 40 hours per week and spends 5 hours to make a table and 2 hours to make a chair.Customer demand requires that he makes at least twice as many chairs as tables.The carpenter stores the finished products in his garage,and there is room for a maximum of 6 furniture pieces each week.Determine the carpenter's optimal production mix.
Question
A company manufactures four products A,B,C,and D that must go through assembly,polishing,and packing before being shipped to a wholesaler.For each product,the time required for these operations is shown below (in minutes)as is the profit per unit sold.
A company manufactures four products A,B,C,and D that must go through assembly,polishing,and packing before being shipped to a wholesaler.For each product,the time required for these operations is shown below (in minutes)as is the profit per unit sold.   The company estimates that each year they have 1667 hours of assembly time,833 hours of polishing time and 1000 hours of packing time available.How many of each product should the company make per year to maximize its yearly profit?<div style=padding-top: 35px>
The company estimates that each year they have 1667 hours of assembly time,833 hours of polishing time and 1000 hours of packing time available.How many of each product should the company make per year to maximize its yearly profit?
Question
A warehouse stocks five different products,A,B,C,and D.The warehouse has a total of 100,000 square feet of floor space available to accommodate all the products that it inventories.The monthly profit per square foot for each product is as follows:
A warehouse stocks five different products,A,B,C,and D.The warehouse has a total of 100,000 square feet of floor space available to accommodate all the products that it inventories.The monthly profit per square foot for each product is as follows:   Each product must have at least 10,000 ft²,and no single product can have more than 25% of the total warehouse space.The warehouse manager wants to know the floor space that should be allocated to each product to maximize profit.<div style=padding-top: 35px>
Each product must have at least 10,000 ft²,and no single product can have more than 25% of the total warehouse space.The warehouse manager wants to know the floor space that should be allocated to each product to maximize profit.
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/48
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 2: Linear Programming Models: Graphical and Computer Methods
1
Unbounded linear programming problems typically arise as a result of misformulation.
True
2
Consider the following linear programming model
Max2X1+3X2 Subject to: X1+X24X12X1,X20\begin{array} { l l } \operatorname { Max } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \geq 4 \\& \mathrm { X } _ { 1 } \geq 2 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
This linear programming model has:

A)redundant constraints
B)infeasible solution
C)alternate optimal solution
D)unique solution
E)unbounded solution
unbounded solution
3
If an isoprofit line can be moved outward such that the objective function value can be made to reach infinity,then this problem has an unbounded solution.
True
4
A redundant constraint is eliminated from a linear programming model.What effect will this have on the optimal solution?

A)feasible region will decrease in size
B)feasible region will increase in size
C)a decrease in objective function value
D)an increase in objective function value
E)no change
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
5
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.What formula should be entered in cell D9 to compute the amount of resource 2 that is consumed?</strong> A)=B9*D9 + C9*D9 B)=SUMPRODUCT(B2:C2,B9:C9) C)=SUM(B9:C9) D)=SUMPRODUCT(B3:C3,B9:C9) E)=SUMPRODUCT(B9:C9,B5:C5)
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.What formula should be entered in cell D9 to compute the amount of resource 2 that is consumed?

A)=B9*D9 + C9*D9
B)=SUMPRODUCT(B2:C2,B9:C9)
C)=SUM(B9:C9)
D)=SUMPRODUCT(B3:C3,B9:C9)
E)=SUMPRODUCT(B9:C9,B5:C5)
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
6
Consider the following linear programming model:
Min2X1+3X2 Subject to: X1+2X21X21X10,X20\begin{array} { l l } \operatorname { Min } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } \\& \mathrm { X } _ { 1 } + 2 \mathrm { X } _ { 2 } \leq 1 \\& \mathrm { X } _ { 2 } \leq 1 \\& \mathrm { X } _ { 1 } \geq 0 , \mathrm { X } _ { 2 } \leq 0\end{array}
This problem violates which of the following assumptions?

A)additivity
B)divisibility
C)non-negativity
D)proportionality
E)linearity
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
7
The constraint for a given resource is given by the following equation:
2X₁ + 3X₂ ≥ 20
If X₁ = 5 and X₂ = 4 how many units of this resource are unused?

A)20
B)2
C)22
D)0
E)9
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
8
The constraint for a given resource is given by the following equation:
2X₁ + 3X₂ ≤ 20
If X₁ = 5 and X₂ = 3,how many units of this resource are unused?

A)20
B)19
C)1
D)0
E)17
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
9
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.What cell reference designates the Target Cell in Solver?</strong> A)E4 B)B3 C)C3 D)D8:D10 E)E8:E10
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.What cell reference designates the Target Cell in "Solver"?

A)E4
B)B3
C)C3
D)D8:D10
E)E8:E10
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
10
Consider the following linear programming model:
Max2X1+3X2 Subject to: X12X23X11X1,X20\begin{array} { l l } \operatorname { Max } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& \mathrm { X } _ { 1 } \leq 2 \\& \mathrm { X } _ { 2 } \leq 3 \\& \mathrm { X } _ { 1 } \leq 1 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
This linear programming model has:

A)alternate optimal solutions
B)unbounded solution
C)redundant constraint
D)infeasible solution
E)non-negative solution
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
11
Consider the following linear programming model:  Max X12+X2+3X3 Subject to: X1+X23X1+X21X1,X20\begin{array} { l } \text { Max } \quad \mathrm { X } _ { 1 } ^ { 2 } + \mathrm { X } _ { 2 } + 3 \mathrm { X } _ { 3 } \\\text { Subject to: } \\\qquad \begin{array} { l } \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 3 \\\mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 1 \\\mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}\end{array}
This problem violates which of the following assumptions?

A)certainty
B)proportionality
C)divisibility
D)linearity
E)integrality
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
12
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.What formula should be entered in cell E4 to compute total profitability?</strong> A)=SUMPRODUCT(B5:C5,B2:C2) B)=SUM(B3:C3) C)=B2*B5 + C2*C5 D)=SUMPRODUCT(B5:C5,E8:E10) E)=B3*B5 + C3*C5
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.What formula should be entered in cell E4 to compute total profitability?

A)=SUMPRODUCT(B5:C5,B2:C2)
B)=SUM(B3:C3)
C)=B2*B5 + C2*C5
D)=SUMPRODUCT(B5:C5,E8:E10)
E)=B3*B5 + C3*C5
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
13
Consider the following linear programming model
This linear programming model has:
Min2X1+3X2 Subject to: X1+X24X12X1,X20\begin{array} { l l } \operatorname { Min } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \geq 4 \\& \mathrm { X } _ { 1 } \geq 2 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}

A)unique optimal solution
B)unbounded solution
C)infeasible solution
D)alternate optimal solution
E)redundant constraints
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
14
If a linear programming problem has alternate optimal solutions,then the objective function value will vary according to each alternate optimal point.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
15
A linear programming model generates an optimal solution with fractional values.This solution satisfies which basic linear programming assumption?

A)certainty
B)divisibility
C)proportionality
D)linearity
E)non-negativity
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
16
________ follows a path of points inside the feasible region to find an optimal solution.

A)The graphical approach
B)The simplex method
C)Karmarkar's method
D)Trial-and-error
E)none of the above
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
17
________ systematically examines corner points,using algebraic steps,until an optimal solution is found.

A)The graphical approach
B)The simplex method
C)Karmarkar's method
D)Trial-and-error
E)none of the above
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
18
"Solver" typically generates which of the following report(s)?

A)answer report
B)sensitivity analysis report
C)limits report
D)A and B only
E)A,B,and C
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
19
Consider the following linear programming model:
MaxX1+X2 Subject to: X1+X22X11X23X1,X20\begin{array} { l l } \operatorname { Max } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 2 \\& \mathrm { X } _ { 1 } \geq 1 \\& \mathrm { X } _ { 2 } \geq 3 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
This linear programming model has:

A)alternate optimal solution
B)unbounded solution
C)redundant constraint
D)infeasible solution
E)unique solution
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
20
Figure 1:
 <strong>Figure 1:   Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:  \begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\ \text { Subject to: } & \\ & 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\ & 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\ & \mathrm { X } _ { 1 } \geq 15 \\ & \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \end{array}  Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.  -Refer to Figure 1.Which cell(s)are the Changing Cells as designated by Solver?</strong> A)E4 B)B2:C2 C)B3:C3 D)D8:D10 E)B5:C5
Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem:
Max:4X1+3X2 Subject to: 3X1+5X24012X1+10X2120X115X1,X20\begin{array} { l l } \operatorname { Max } : & 4 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \\& 3 \mathrm { X } _ { 1 } + 5 \mathrm { X } _ { 2 } \leq 40 \\& 12 \mathrm { X } _ { 1 } + 10 \mathrm { X } _ { 2 } \leq 120 \\& \mathrm { X } _ { 1 } \geq 15 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}
Note: Cells B3 and C3 are the designated cells for the optimal values of X? and X?,respectively,while cell E4 is the designated cell for the objective function value.Cells D8:D10 designate the left-hand side of the constraints.

-Refer to Figure 1.Which cell(s)are the Changing Cells as designated by "Solver"?

A)E4
B)B2:C2
C)B3:C3
D)D8:D10
E)B5:C5
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
21
A linear programming model has the following objective function:
Max: X₁² + 3X₂ + 4X₃.This model violates a key linear programming model assumption.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
22
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.
Use Solver to find the optimal values of X₁ and X₂.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
23
Linear programming models typically do not have coefficients (i.e. ,objective function or constraint coefficients)that assume random values.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
24
If a redundant constraint is eliminated from a linear programming model,this will have an impact on the optimal solution.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
25
When using Solver,the parameter Changing Cells is typically associated with the objective function.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
26
An ice cream shop sells single scoop ice cream cones that come in three flavors: chocolate only,vanilla only,and chocolate-vanilla twist.The cones are prepackaged and sold to a supermarket daily.The ingredients used along with the minimum demand of each flavor are shown as follows:
An ice cream shop sells single scoop ice cream cones that come in three flavors: chocolate only,vanilla only,and chocolate-vanilla twist.The cones are prepackaged and sold to a supermarket daily.The ingredients used along with the minimum demand of each flavor are shown as follows:   Each day,40 pounds of chocolate and 38 pounds of vanilla are supplied to the ice cream shop from an outside vendor.The chocolate,vanilla,and chocolate-vanilla twist each yield a profit of $2.00,$2.50,and $3.00 per cone,respectively.How many chocolate,vanilla,and chocolate-vanilla twist cones must prepackage daily to maximize daily profits?
Each day,40 pounds of chocolate and 38 pounds of vanilla are supplied to the ice cream shop from an outside vendor.The chocolate,vanilla,and chocolate-vanilla twist each yield a profit of $2.00,$2.50,and $3.00 per cone,respectively.How many chocolate,vanilla,and chocolate-vanilla twist cones must prepackage daily to maximize daily profits?
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
27
Creatine and protein are common supplements in most bodybuilding products.Bodyworks,a nutrition health store,makes a powder supplement that combines creatine and protein from two ingredients (X₁ and X₂).Ingredient X₁ provides 20 grams of protein and 5 grams of creatine per pound.Ingredient X₂ provides 15 grams of protein and 3 grams of creatine per pound.Ingredients X₁ and X₂ cost Bodyworks $5 and $7 per pound,respectively.Bodyworks wants its supplement to contain at least 30 grams of protein and 10 grams of creatine per pound and be produced at the least cost.
Determine what combination will maximize profits.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
28
A linear programming model has the following two constraints: X₁ ≥ 3 and X₁ ≥ 4.This model has a redundant constraint.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
29
A furniture store produces beds and desks for college students.The production process requires assembly and painting.Each bed requires 6 hours of assembly and 4 hours of painting.Each desk requires 4 hours of assembly and 8 hours of painting.There are 40 hours of assembly time and 45 hours of painting time available each week.Each bed generates $35 of profit and each desk generates $45 of profit.As a result of a labor strike,the furniture store is limited to producing at most 8 beds each week.Determine how many beds and desks should be produced each week to maximize weekly profits.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
30
In a product mix problem,a decision maker has limited availability of weekly labor hours.Labor hours would most likely constitute a decision variable rather than a constraint.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
31
A computer retail store sells two types of flat screen monitors: 17 inches and 19 inches,with a profit contribution of $300 and $250,respectively.The monitors are ordered each week from an outside supplier.As an added feature,the retail store installs on each monitor a privacy filter that narrows the viewing angle so that only persons sitting directly in front of the monitor are able to see on-screen data.Each 19" monitor consumes about 30 minutes of installation time,while each 17" monitor requires about 10 minutes of installation time.The retail store has approximately 40 hours of labor time available each week.The total combined demand for both monitors is at least 40 monitors each week.How many units of each monitor should the retail store order each week to maximize its weekly profits and meet its weekly demand?
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
32
The simplex method is an algebraic solution procedure for a linear programming problem.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
33
It is possible to solve graphically a linear programming model with 4 decision variables.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
34
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.
Use Solver to find the optimal values of X₁ and X₂.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
35
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.
Use Solver to find the optimal values of X₁ and X₂.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
36
Karmarkar's method is synonymous with the corner point method.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
37
An isoprofit line represents a line whereby all profits are the same along the line.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
38
It is possible for a linear programming model to yield an optimal solution that has fractional values.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
39
A linear programming problem has the following two constraints: X₁ ≤ 20 and X₁ ≥ 25.This problem is infeasible.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
40
Consider the following linear programming problem.
Consider the following linear programming problem.   Use Solver to find the optimal values of X₁ and X₂.
Use Solver to find the optimal values of X₁ and X₂.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
41
A company that is introducing a new product would like to generate maximum market exposure.The marketing department currently has $100,000 of advertising budget for the year and is considering placing ads in three media: radio,television,and newspapers.The cost per ad and the exposure rating are as follows:
A company that is introducing a new product would like to generate maximum market exposure.The marketing department currently has $100,000 of advertising budget for the year and is considering placing ads in three media: radio,television,and newspapers.The cost per ad and the exposure rating are as follows:   The marketing department would like to place twice as many radio ads as television ads.They also would like to place at least 4 ads in each advertising media.What is the optimal allocation to each advertising medium to maximize audience exposure?
The marketing department would like to place twice as many radio ads as television ads.They also would like to place at least 4 ads in each advertising media.What is the optimal allocation to each advertising medium to maximize audience exposure?
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
42
A bank is attempting to determine where its assets should be allocated in order to maximize its annual return.At present,$750,000 is available for investment in three types of mutual funds: A,B,and C.The annual rate of return on each type of fund is as follows: fund A,15%;fund B,12%;fund C;13%.The bank's manager has placed the following restrictions on the bank's portfolio:
• No more than 20% of the total amount invested may be in fund A.
• The amount invested in fund B cannot exceed the amount invested in fund C.
Determine the optimal allocation that maximizes the bank's annual return.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
43
A meat packing store produces a dog food mixture that is sold to pet retail outlets in bags of 10 pounds each.The food mixture contains the ingredients turkey and beef.The cost per pound of each of these ingredients is as follows:
A meat packing store produces a dog food mixture that is sold to pet retail outlets in bags of 10 pounds each.The food mixture contains the ingredients turkey and beef.The cost per pound of each of these ingredients is as follows:   Each bag must contain at least 5 pounds of turkey.Moreover,the ratio of turkey to beef must be at least 2 to 1.What is the optimal mixture of the ingredients that will minimize total cost?
Each bag must contain at least 5 pounds of turkey.Moreover,the ratio of turkey to beef must be at least 2 to 1.What is the optimal mixture of the ingredients that will minimize total cost?
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
44
A company can decide how many additional labor hours to acquire for a given week.Subcontractors will only work a maximum of 20 hours a week.The company must produce at least 200 units of product A,300 units of product B,and 400 units of product C.In 1 hour of work,worker 1 can produce 15 units of product A,10 units of product B,and 30 units of product C.Worker 2 can produce 5 units of product B,20 units of product B,and 35 units of product C.Worker 3 can produce 20 units of product A,15 units of product B,and 25 units of product C.Worker 1 demands a salary of $50/hr,worker 2 demands a salary of $40/hr,and worker 3 demands a salary of $45/hr.The company must choose how many hours they should hire from each worker to meet their production requirements and minimize labor cost.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
45
Suppose that a farmer has 5 acres of land that can be planted with either wheat,corn,or a combination of the two.To ensure a healthy crop,a fertilizer and an insecticide must be applied at the beginning of the season before harvesting.The farmer currently has 100 pounds of the fertilizer and 150 pounds of the insecticide at the beginning of the season.Each acre of wheat planted requires 10 pounds of the fertilizer and 12 pounds of the insecticide.Each acre of corn planted requires 13 pounds of the fertilizer and 11 pounds of the insecticide.Each acre of wheat harvested yields a profit of $600,while each acre of corn harvested yields $750 in profit.What is the optimal allocation for the crops that maximizes the farmer's profit?
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
46
A carpenter makes tables and chairs.Each table can be sold for a profit of $50 and each chair for a profit of $30.The carpenter works a maximum of 40 hours per week and spends 5 hours to make a table and 2 hours to make a chair.Customer demand requires that he makes at least twice as many chairs as tables.The carpenter stores the finished products in his garage,and there is room for a maximum of 6 furniture pieces each week.Determine the carpenter's optimal production mix.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
47
A company manufactures four products A,B,C,and D that must go through assembly,polishing,and packing before being shipped to a wholesaler.For each product,the time required for these operations is shown below (in minutes)as is the profit per unit sold.
A company manufactures four products A,B,C,and D that must go through assembly,polishing,and packing before being shipped to a wholesaler.For each product,the time required for these operations is shown below (in minutes)as is the profit per unit sold.   The company estimates that each year they have 1667 hours of assembly time,833 hours of polishing time and 1000 hours of packing time available.How many of each product should the company make per year to maximize its yearly profit?
The company estimates that each year they have 1667 hours of assembly time,833 hours of polishing time and 1000 hours of packing time available.How many of each product should the company make per year to maximize its yearly profit?
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
48
A warehouse stocks five different products,A,B,C,and D.The warehouse has a total of 100,000 square feet of floor space available to accommodate all the products that it inventories.The monthly profit per square foot for each product is as follows:
A warehouse stocks five different products,A,B,C,and D.The warehouse has a total of 100,000 square feet of floor space available to accommodate all the products that it inventories.The monthly profit per square foot for each product is as follows:   Each product must have at least 10,000 ft²,and no single product can have more than 25% of the total warehouse space.The warehouse manager wants to know the floor space that should be allocated to each product to maximize profit.
Each product must have at least 10,000 ft²,and no single product can have more than 25% of the total warehouse space.The warehouse manager wants to know the floor space that should be allocated to each product to maximize profit.
Unlock Deck
Unlock for access to all 48 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 48 flashcards in this deck.