The American Sausage Company (ASC) makes sausage and the total amount of a batch of sausage is 1000 pound. The ingredients are beef, filler (including spices) and preservatives. Ingredient costs are as follows: beef costs $2.50 per pound, filler costs $1.20 per pound and preservatives cost $1.80 per pound. Government regulations require the product to have at least 60% beef, no more than 20% filler and at most 5% preservatives. However, to maintain freshness, the company must add at least 1% preservatives. The companys problem is to find the optimal mix of ingredients (in pounds) that minimizes the cost of making a batch of sausage, using linear programming (LP).

All decision variables:

x1 = pounds of beef

x2 = pounds of filler

x3 = pounds of preservatives

Which of the following is a constraint?

		x1 + x2 + x3 > 1000
		x1 + x2 + x3 1000
		x1 + x2 + x3 < 1000
		x1 + x2 + x3 1000
		x1 + x2 + x3 = 1000

Which of the following is a constraint?

		x1 , x2 , x3 > 0
		x1 , x2 , x3 0
		x1 , x2 , x3 < 0
		x1 , x2 , x3 0
		x1 , x2 , x3 = 0