A manufacturer produces two types of fruit juice for filling and distributing, the X-S fruit juice and the Super fruit juice. A batch of X-S costs $375 to manufacture and a container of the Super costs $420. The manufacturer wishes to establish the weekly production plan that minimizes cost. Production of these products is limited to processing, testing and material. Each batch of X-S requires 4 hours processing whereas each batch of Super requires 2 hours of processing. Further each batch of X-S requires 4 hours of testing compared to 6 hours of testing for a batch of Super. A batch of X-S and a batch of Super each require 1 litre of material. Processing and testing have a maximum of 100 and 180 hours available respectively and the total material available is 40 litres. Because of a distribution agreement, the sales of X-S are limited to a weekly maximum of 20 batches and to honour an agreement with a loyal distributor, at least 10 batches of Super must be sold each week. By constructing and graphically solving an appropriate linear programming model, determine the optimum product mix of X-S and Super to minimize manufacturing costs.
A manufacturer produces two types of fruit juice for filling and distributing, the X-S fruit juice and the Super fruit juice. A batch of X-S costs $375 to manufacture and a container of the Super costs $420. The manufacturer wishes to establish the weekly production plan that minimizes cost. Production of these products is limited to processing, testing and material.
Each batch of X-S requires 4 hours processing whereas each batch of Super requires 2 hours of processing. Further each batch of X-S requires 4 hours of testing compared to 6 hours of testing for a batch of Super. A batch of X-S and a batch of Super each require 1 litre of material.
Processing and testing have a maximum of 100 and 180 hours available respectively and the total material available is 40 litres. Because of a distribution agreement, the sales of X-S are limited to a weekly maximum of 20 batches and to honour an agreement with a loyal distributor, at least 10 batches of Super must be sold each week.
By constructing and graphically solving an appropriate linear programming model, determine the optimum product mix of X-S and Super to minimize manufacturing costs.
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)