0% found this document useful (0 votes)
227 views8 pages

Donnor Meat Processing: Objective

The Donnor meat processing firm produces three types of wieners from chicken, beef, pork, and cereal. They want to determine how much of each wiener type to produce to maximize profits. A linear programming model is formulated with the objective of maximizing total profits and constraints on the available ingredients. The model is solved using a computer to determine the optimal production quantities.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
227 views8 pages

Donnor Meat Processing: Objective

The Donnor meat processing firm produces three types of wieners from chicken, beef, pork, and cereal. They want to determine how much of each wiener type to produce to maximize profits. A linear programming model is formulated with the objective of maximizing total profits and constraints on the available ingredients. The model is solved using a computer to determine the optimal production quantities.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

Donnor Meat Processing

The Donnor meat processing firm produces wieners from four ingredients: chicken, beef, pork, and a
cereal additive. The firm produces three types of wieners: regular, beef, and all-meat. The company has
the following amounts of each ingredient available on a daily basis:

Each type of wiener has certain ingredient specifications, as follows:

The firm wants to know how many pounds of wieners of each type to produce to maximize profits.
a. Formulate a linear programming model for this problem.
b. Solve the model by using the computer.

Let
R pounds of Regular wiener
B pounds of Beef wiener
A pounds of All-meat wiener

Objective
Maximize Profit = $R + $B + $A

Selling Price/pound Cost/pound Profit/pound


Regular 0.9
Beef 1.25
All Meat 1.75
Constraints

Non-Negativity: See solver setting

M W
Variables 15,000 30,755

Objective Function $ 3.40 $ 4.08

Constraints:
Total floor space used (sqft) 15,000 30,755
Min. Floor space used (sqft) for M 1 0
Min. Floor space used (sqft) for W 0 1
Min. Floor space used (sqft) for C 0 0
Min. Floor space used (sqft) for T 0 0
Min. Floor space used (sqft) for H 0 0
Min. Floor space used (sqft) for E 0 0
Min. Floor space used (sqft) for A 0 0
Max Floor space used (sqft) for M 15,000 0
Max Floor space used (sqft) for W 0 30,755
Max Floor space used (sqft) for C 0 0
Max Floor space used (sqft) for T 0 0
Max Floor space used (sqft) for H 0 0
Max Floor space used (sqft) for E 0 0
Max Floor space used (sqft) for A 0 0

It brings a lower net profit of $574,653 versus the original solution $625,083, difference of $50,430.
15000 floor space (sqft) devoted for Men's clothing, which is 3,000 more than alloted in original solution(a)
30754.71698 floor space (sqft) devoted for Women's clothing
30754.71698 floor space (sqft) devoted for Children's clothing which is 13,000 more than alloted in original solution(a)
30754.71698 floor space (sqft) devoted for Toys
15000 floor space (sqft) devoted for Housewares
16509.43396 floor space (sqft) devoted for Electronics which is 4,000 more than alloted in original solution(a)
15000 floor space (sqft) devoted for Auto supplies
beef, pork, and a
t. The company has

aximize profits.
C T H E A
30,755 30,755 15,000 16,509 15,000
Maximize
Profit
$ 3.60 $ 4.16 $ 3.28 $ 3.92 $ 3.04 $ 574,653

Totals <=>
30,755 30,755 15,000 16,509 15,000 160,000 <=
0 0 0 0 0 15,000 >=
0 0 0 0 0 30,755 >=
1 0 0 0 0 30,755 >=
0 1 0 0 0 30,755 >=
0 0 1 0 0 15,000 >=
0 0 0 1 0 16,509 >=
0 0 0 0 1 15,000 >=
0 0 0 0 0 15,000.00 <=
0 0 0 0 0 30,754.72 <=
30,755 0 0 0 0 30,754.72 <=
0 30,755 0 0 0 30,754.72 <=
0 0 15,000 0 0 15,000.00 <=
0 0 0 16,509 0 16,509.43 <=
0 0 0 0 15,000 15,000.00 <=

e of $50,430. 20% of total floor space used LESS the inventory s


lloted in original solution(a)
Note: The non-negativity of varia
an alloted in original solution(a) the options portion of the

d in original solution(a)
=SUMPRODUCT($C$69:$I$69,C71:I71)

Limits Excess/Lack Binding


160,000 - Yes
15,000 - Yes
15,000 15,755 Yes
15,000 15,755 Yes
15,000 15,755 Yes
15,000 - Yes
15,000 1,509 Yes
15,000 - Yes
30,754.72 15,755 Yes
30,754.72 - Yes
30,754.72 - Yes
30,754.72 - Yes
30,754.72 15,755 Yes
30,754.72 14,245 Yes
30,754.72 15,755 Yes

space used LESS the inventory space

Note: The non-negativity of variables is set-up using


the options portion of the solver table.

You might also like