[go: up one dir, main page]

0% found this document useful (0 votes)
253 views3 pages

Exercise 4

Circle K farms consume 3 tons of specialty feed daily, which must meet calcium, protein, and fiber requirements. The feed is a mixture of limestone, corn, and soybeans. The document provides the nutritional content of each ingredient and formulates the feeding problem as a goal programming model to determine the optimal amounts of each ingredient needed to meet the dietary requirements while minimizing deviations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
253 views3 pages

Exercise 4

Circle K farms consume 3 tons of specialty feed daily, which must meet calcium, protein, and fiber requirements. The feed is a mixture of limestone, corn, and soybeans. The document provides the nutritional content of each ingredient and formulates the feeding problem as a goal programming model to determine the optimal amounts of each ingredient needed to meet the dietary requirements while minimizing deviations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Circle K farms consume 3 tons of specialty feed daily.

That feed is a mixture of


limestone, corn and soybeans, and must meet the following dietary requirements:
Calcium. At least 0.8%, but not more than 1.2%.
Protein. At least 22%.
Fiber. 5% at most
The following table shows the nutritional content of the feed ingredients.

Pounds per ingredient


Ingredients
Calcium Protein Fiber
Limestone 0.380 0.00 0.00
Corn 0.001 0.09 0.02
Soy 0.002 0.50 0.08
Formulate the problem as a goal programming model.
Variable declaration:
Xc = tons of limestone per day.
Xm = tons of corn per day. Xs =
tons of soybeans per day.

Achieving the goals:

A. Xc + Xm + Xs <= 3
B. 0.38*Xc + 0.001*Xm + 0.002*Xs <= 0.012*(Xc + Xm+ Xs)
C. 0.38*Xc + 0.001*Xm + 0.002*Xs >= 0.008*(Xc + Xm+ Xs)
D. 0.09*Xm + 0.5*Xs >=0.22 *(Xc + Xm+ Xs)
E. 0.02*Xm + 0.08*Xs <= 0.05*(Xc + Xm+ Xs)
F. Xm, Xs, Xc >=0
Transforming and achieving
goals:
A. Xc+ Xm+ Xs+ E1 -F1= 3
B. 0.368*Xc - 0.011*Xm -
0.01*Xs + E2 -F2= 0
C. 0.372*Xc - 0.007*Xm - 0.006*Xs + E3-F3= 0
D. -0.22*Xc - 0.13*Xm + 0.28*Xs + E4-F4= 0
E. -0.05*Xc - 0.3*Xm + 0.03*Xs + E5 -F5= 0

Therefore:
Min = F1 + F2 + E3 + E4 + F5

You might also like