1. Construct the general linear programming problem with the objective function and all constraints. Do not solve! ABC company makes two types of Frisbees, red and blue. Red Frisbees sell for $10 and blue Frisbees sell for 8$. ABC anticipates the total demand for Frisbees to be at least 10,000 for the month. It takes $3 in materials for each red Frisbee and $2 in materials for each blue Frisbee. There is $30,000 available for material costs per month. It takes 1 hour to manufacture a red Frisbee and 1/2 hour to manufacture a blue Frisbee. There are a total of 40,000 man hours per month. ABC wishes to find how many red and how many blue Frisbees should be produced to produce a maximum revenue.

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 $12,000/day to operate, and it yields 45 oz of gold and 3000 oz of silver each of x days. The Horseshoe Mine costs $14,000/day to operate, and it yields 80 oz of gold and 1250 oz of silver each of y days. Company management has set a target of at least 600 oz of gold and 16,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

Formulate but do not solve the following exercise as a linear programming problem.National Business Machines manufactures x model A fax machines and y model B fax machines. Each model A cost $120 to make, and each model B costs $150. The profits are $30 for each model A and $30 for each model B fax machine. If the total number of fax machines demanded per month does not exceed 1900 and the company has earmarked not more than $600,000/month for manufacturing costs, how many units of each model should National make each month to maximize its monthly profits P in dollars ? Maximize      P  =             subject to the constraints manufacturing costs             number produced                     x ≥ 0         y ≥ 0

Solve the following linear programming problem.   You are taking two dietary supplements daily: Supplement A and Supplement B.   An ounce of supplement A contains 9 units of calcium, 8 units of vitamin D, and 5 units of sodium.   An ounce of supplement B contains 2 units of calcium, 4 units of vitamin D, and 3 units of sodium.   Your goal is to get at least 90 units of calcium and at least 120 units of vitamin D from the supplements daily, while at the same time reducing the amount of sodium that you will get.    How many ounces of each supplement should you take daily to reach your goals?   Ounces of Supplement A =  Blank 1. Fill in the blank, read surrounding text. Ounces of Supplement B =  Blank 2. Fill in the blank, read surrounding text.   How many units of sodium will you get daily under these circumstances?   Units of Sodium =  Blank 3. Fill in the blank, read surrounding text.