Also, we must have *2 0. y20. Therefore, the above problem can be formulated as follows: find x and y that maximize - 2x + 1.25 y subject to the constraints: S 130 3 y S 170 3 y 2 0 Use the technique of linear programming and find feasible region of the problem and locate our extreme points. -inin

Algebra for College Students
10th Edition
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Jerome E. Kaufmann, Karen L. Schwitters
Chapter12: Algebra Of Matrices
Section12.CM: Cumulative Review Problem Set
Problem 115CM
icon
Related questions
Topic Video
Question
100%
Q6.
(A)
A candy manufacturer has 130 pounds of chocolate-covered cherries and 170
pounds of chocolate-covered mints in stock. He decides to sell them in the form of
two different mixtures. One mixture will contain half cherries and half mints by
weight and will sell for $2.00 per pound. The other mixture will contain one-third
cherries and two-thirds mints by weight and will sell for $1.25 per pound. How many
pounds of each mixture should the candy manufacturer prepare in order to
maximize his sales revenue?
let us call A the mixture of half cherries and half mints, and B the mixture which is
one-third cherries and two-thirds mints. Let x be the number of pounds of A to be
prepared and y the number of pounds of B to be prepared. The revenue function can
then be written as
2 - 2x + 1. 25 y
Since each pound of A contains one-half pound of cherries and each pound of B
contains one-third pound of cherries, the total number of pounds of cherries used in
both mixtures is
Similarly, the total number of pounds of mints used in both mixtures is:
Now, since the manufacturer can use at most 130 pounds of cherries and 170
pounds of mints, we have the constraints:
ys 130
1.
S 170
Also, we must have *2 0, y 20. Therefore, the above problem can be formulated as
- 2x + 1.25 y subject to the constraints:
follows: find x and y that maximize ?
S 130
-y
3
2
=y s 170
3
2.
Use the technique of linear programming and find feasible region of the problem and
locate our extreme points.
Transcribed Image Text:Q6. (A) A candy manufacturer has 130 pounds of chocolate-covered cherries and 170 pounds of chocolate-covered mints in stock. He decides to sell them in the form of two different mixtures. One mixture will contain half cherries and half mints by weight and will sell for $2.00 per pound. The other mixture will contain one-third cherries and two-thirds mints by weight and will sell for $1.25 per pound. How many pounds of each mixture should the candy manufacturer prepare in order to maximize his sales revenue? let us call A the mixture of half cherries and half mints, and B the mixture which is one-third cherries and two-thirds mints. Let x be the number of pounds of A to be prepared and y the number of pounds of B to be prepared. The revenue function can then be written as 2 - 2x + 1. 25 y Since each pound of A contains one-half pound of cherries and each pound of B contains one-third pound of cherries, the total number of pounds of cherries used in both mixtures is Similarly, the total number of pounds of mints used in both mixtures is: Now, since the manufacturer can use at most 130 pounds of cherries and 170 pounds of mints, we have the constraints: ys 130 1. S 170 Also, we must have *2 0, y 20. Therefore, the above problem can be formulated as - 2x + 1.25 y subject to the constraints: follows: find x and y that maximize ? S 130 -y 3 2 =y s 170 3 2. Use the technique of linear programming and find feasible region of the problem and locate our extreme points.
Expert Solution
steps

Step by step

Solved in 6 steps with 1 images

Blurred answer
Knowledge Booster
Optimization
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897…
Glencoe Algebra 1, Student Edition, 9780079039897…
Algebra
ISBN:
9780079039897
Author:
Carter
Publisher:
McGraw Hill
PREALGEBRA
PREALGEBRA
Algebra
ISBN:
9781938168994
Author:
OpenStax
Publisher:
OpenStax
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax