Question:

Weenies and Buns is a food processing plant which manufactures hot

dogs and hot dog buns. They grind their own flour for the hot
dog buns at a maximum rate of 200 pounds per week. Each hot dog bun
requires 0.1 pound of flour. They currently have a contract with Pigland
Inc., which specifies that a delivery of 800 pounds of pork product is
delivered every Monday. Each hot dog requires ¼ pound of pork
product. All other ingredients in the hot dog and buns are in plentiful
supply. Finally, the labour force at Weenies and Buns consists of 5
employees working full time (40 hours per week each). Each hot dog
requires 3 minutes of labour, and each bun requires 2 minutes
of labour. Each hot dog yields a profit of $0.20 and each bun yields a
profit of $0.10. Weenies and Buns would like to know how many hot
dogs and how many buns they should produce so as to achieve the
highest possible profits. Formulate a linear programming model for
this problem.

Solution:
Let X1, X2= number of hot dogs, buns to be produced.
Max z= 0.2 X1 + 0.1 X2 ($ per week)
s.t.
0.1 X2  200 (pounds per week)
0.25 X1  800 (pounds per week)
3 X1 + 2 X2  12,000 (=54060 minutes per week)
with X1, X2  0

This study source was downloaded by 100000872500581 from CourseHero.com on 02-04-2024 09:27:47 GMT -06:00

https://www.coursehero.com/file/59536653/Linear-Programmingpdf/
Powered by TCPDF (www.tcpdf.org)