Formulate but do not solve the following exercise as a linear programming problem. Perth Mining Company operates two mines for the purpose of extracting gold and silver. The Saddle Mine costs $14,000/day to operate, and it yields 50 oz of gold and 3000 oz of silver each of x days. The Horseshoe Mine costs $17,000/day to operate, and it yields 80 oz of gold and 1000 oz of silver each of y days. Company management has set a target of at least 750 oz of gold and 18,000 oz of silver. How many days should each mine be operated so that the target can be met at a minimum cost C in dollars?

Minimize

C

=

subject to the constraints

gold

silver

				x 0
				y 0