Formulate but do not solve the following exercise as a linear programming problem. Beyer Pharmaceutical produces three kinds of cold formulas: x thousand bottles of Formula I, y thousand bottles Formula II, and thousand bottles Formula III. It takes 1.5 hr to produce 1,000 bottles of Formula I, 3 hr to produce 1,000 bottles of Formula II, and 4.5 hr to produce 1,000 bottles of Formula III. The profits for each 1,000 bottles of Formula I, Formula II, and Formula III are $170, $220, and $300, respectively. For a certain production run, there are enough ingredients on hand to make at most 13,000 bottles of Formula I, 10,000 bottles of Formula II, and 14,000 bottles of Formula III. Furthermore, the time for the production run is limited to a maximum of 60 hr. How many bottles of each formula should be produced in this production run so that the profit, P (in dollars), is maximized? subject to the constraints Maximize production time Formula I Formula II Formula III P = 00 x20 y20 Z20

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Formulate but do not solve the following exercise as a linear programming problem.
Beyer Pharmaceutical produces three kinds of cold formulas: x thousand bottles of Formula I, y thousand bottles Formula II, and z thousand bottles Formula III. It takes 1.5 hr to produce 1,000 bottles of
Formula I, 3 hr to produce 1,000 bottles of Formula II, and 4.5 hr to produce 1,000 bottles of Formula III. The profits for each 1,000 bottles of Formula I, Formula II, and Formula III are $170, $220, and
$300, respectively. For a certain production run, there are enough ingredients on hand to make at most 13,000 bottles of Formula I, 10,000 bottles of Formula II, and 14,000 bottles of Formula III.
Furthermore, the time for the production run is limited to a maximum of 60 hr. How many bottles of each formula should be produced in this production run so that the profit, P (in dollars), is maximized?
Maximize
production time
Formula I
Formula II
Formula III
P =
x ≥ 0
y ≥ 0
Z≥ 0
subject to the constraints
Transcribed Image Text:Formulate but do not solve the following exercise as a linear programming problem. Beyer Pharmaceutical produces three kinds of cold formulas: x thousand bottles of Formula I, y thousand bottles Formula II, and z thousand bottles Formula III. It takes 1.5 hr to produce 1,000 bottles of Formula I, 3 hr to produce 1,000 bottles of Formula II, and 4.5 hr to produce 1,000 bottles of Formula III. The profits for each 1,000 bottles of Formula I, Formula II, and Formula III are $170, $220, and $300, respectively. For a certain production run, there are enough ingredients on hand to make at most 13,000 bottles of Formula I, 10,000 bottles of Formula II, and 14,000 bottles of Formula III. Furthermore, the time for the production run is limited to a maximum of 60 hr. How many bottles of each formula should be produced in this production run so that the profit, P (in dollars), is maximized? Maximize production time Formula I Formula II Formula III P = x ≥ 0 y ≥ 0 Z≥ 0 subject to the constraints
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,