A food wholesaler has three kinds of individual bags of potato chips regular, barbeque, and salt and vinegar. She wants to sell the bags of chips in bulk packages. The bronze package consists of 20 bags of regular and 10 bags of barbeque. The silver package contains 20 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The gold package consists of 30 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The profit is $50 on each bronze package, $60 on each säver package, and $50 on wach gold package. The food wholesaler has a total of 8500 bags of regular chips, 3000 bags of barbeque, and 2700 bags of salt and vinegar. Assume all the packages will be sold Use the simplex method to complete parts (a) and (b) (a) How many gold, silver, and bronze packages should be made up in order to maximize profit? What is the maximum profit? Set up the linear programming problem. Let x₁, x₂. and x, represent the numbers of bronze, siliver, and gold packages made up, respectively, and let z be the total profit subject to 20 20x, +20x+30x, ▼ 10x10x+10x Y GED 10x₂+ 10x x₁20.x₂20 x 20

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

Need only a handwritten solution only (not a typed one).

A food wholesaler has three kinds of individual bags of potato chips regular, barbeque, and salt and vinegar. She wants to sell the bags of chips in bulk packages. The bronze
package consists of 20 bags of regular and 10 bags of barbeque. The silver package contains 20 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The gold
package consists of 30 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The profit is $50 on each bronze package, $60 on each säver package, and $90 on
each gold package. The food wholesaler has a total of 8500 bags of regular chips, 3000 bags of barbeque, and 2700 bags of salt and vinegar. Assume all the packages will be sold
Use the simplex method to complete parts (a) and (b)
(a) How many gold, silver, and bronze packages should be made up in order to maximize profit? What is the maximum profit?
Set up the linear programming problem. Let x₁, X₂. and x, represent the numbers of bronze, silver, and gold packages made up, respectively, and let z be the total profit
subject to
29
20x, +20x+30x
10x + 10x +10x ▼
GED
10x+10x
x₁20x₂20 x 20
(Do not factor Do not include the $ symbol in your answers).
Transcribed Image Text:A food wholesaler has three kinds of individual bags of potato chips regular, barbeque, and salt and vinegar. She wants to sell the bags of chips in bulk packages. The bronze package consists of 20 bags of regular and 10 bags of barbeque. The silver package contains 20 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The gold package consists of 30 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The profit is $50 on each bronze package, $60 on each säver package, and $90 on each gold package. The food wholesaler has a total of 8500 bags of regular chips, 3000 bags of barbeque, and 2700 bags of salt and vinegar. Assume all the packages will be sold Use the simplex method to complete parts (a) and (b) (a) How many gold, silver, and bronze packages should be made up in order to maximize profit? What is the maximum profit? Set up the linear programming problem. Let x₁, X₂. and x, represent the numbers of bronze, silver, and gold packages made up, respectively, and let z be the total profit subject to 29 20x, +20x+30x 10x + 10x +10x ▼ GED 10x+10x x₁20x₂20 x 20 (Do not factor Do not include the $ symbol in your answers).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
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,