Lee Burrell 1) Farmer Jones must determine how many acres of corn and wheat to plant this year.

An acre of wheat yields 25 bushels of wheat and requires 10 hours of labor per week. An acre of corn yields 10 bushels of corn and requires 4 hours of labor per week. All wheat can be sold at $4 a bushel, and all corn can be sold at $3 a bushel. Seven acres of land and 40 hours per week of labor are available. Government regulations require that at least 30 bushels of corn be produced during the current year. Let x1 number of acres of corn planted, and x2number of acres of wheat planted. Using these decision variables, formulate an LP whose solution will tell Farmer Jones how to maximize the total revenue from wheat and corn. Decision Variables: x1 = Acres of corn planted x2 = Acres of wheat planted Objective Function: Maximize profit, Z, where Z = 30x1 + 100x2 Constraints: Land: x1 + x2 7 Labor: 4 x1 + 10 x2 40 Government Requirements: 10 x1 30 x1 0 x2 0 Answer: Z = (3, 2.8), Z = 370

2 Answer these questions about Problem 1. a Is (x12, x23) in the feasible region? - NO b Is (x14, x23) in the feasible region? - NO c Is (x12, x2 1) in the feasible region? - NO

d Is (x13, x22) in the feasible region? YES 1) In the post office example, suppose that each full-time employee works 8 hours per day. Thus, Mondays requirement of 17 workers may be viewed as a requirement of 8(17)=136 hours. The post office may meet its daily labor requirements by using both full-time and part-time employees. During each week, a full-time employee works 8 hours a day for five consecutive days, and a part-time employee works 4 hours a day for five consecutive days. A full-time employee costs the post office $15 per hour, whereas a part-time employee (with reduced fringe benefits) costs the post office only $10 per hour. Union requirements limit part-time labor to 25% of weekly labor requirements. Formulate an LP to minimize the post offices weekly labor costs.
min z = ($15/hr)(8hrs)(5 cons days)(x1+x2+x3+x4+x5+x6+x7)+ ($10/hr)(4hrs)(5 cons days)(x8+x9+x10+x11+x12+x13+x14) s.t. (8(x1 +x4+x5+x6+x7))+(4(x8 +x11+x12+x13+x14)) >= 136 (Monday constraint) s.t. (8(x1+x2 +x5+x6+x7))+(4(x8+x9 +x12+x13+x14)) >= 104 (Tuesday constraint) s.t. (8(x1+x2+x3 +x6+x7))+(4(x8+x9+x10 +x13+x14)) >= 120 (Wednesday constraint) s.t. (8(x1+x2+x3+x4 +x7))+(4(x8+x9+x10+x11 +x14)) >=152 (Thursday constraint) s.t. (8(x1+x2+x3+x4+x5 ))+(4(x8+x9+x10+x11+x12 )) >= 112 (Friday constraint) s.t. (8( +x2+x3+x4+x5+x6 ))+(4( +x9+x10+x11+x12+x13)) >=128 (Saturday constraint) s.t. (8( +x3+x4+x5+x6+x7))+(4( +x10+x11+x12+x13+x14)) >= 88 (Sunday constraint) s.t. (4hours*5days)(x8+x9+x10+x11+x12+x13+x14)>=.25(136+104+120+152+112+128+88) s.t. All Xs must be integers >= 0.

minimize z =(15)(8)(5)(x1+x2+x3+x4+x5+x6+x7)+(10)(4)(5) (x8+x9+x10+x11+x12+x13+x14) subject to (8)(x1+x4+x5+x6+x7)+(4)(x8+x11+x12+x13+x14)>=136, (8)(x1+x2+x5+x6+x7)+(4)(x8+x9+x12+x13+x14)>=104, (8)(x1+x2+x3+x6+x7)+(4)(x8+x9+x10+x13+x14)>=120, (8)(x1+x2+x3+x4+x7)+(4)(x8+x9+x10+x11+x14)>=152, (8)(x1+x2+x3+x4+x5)+(4)(x8+x9+x10+x11+x12)>=112, (8)(x2+x3+x4+x5+x6)+(4)(x9+x10+x11+x12+x13)>=128, (8)(x3+x4+x5+x6+x7))+(4)(+x10+x11+x12+x13+x14)>=88, (20)(x8+x9+x10+x11+x12+x13+x14)>=(.25)(136+104+120+152+112+128+88) (Tried putting this into Simplex Linear Programming solver, but it couldnt solve).

3) Suppose that the post office can force employees to work one day of overtime each week. For example, an employee whose regular shift is Monday to Friday can also be required to work on Saturday. Each employee is paid $50 a day for each of the first five days worked during a week and $62 for the overtime day (if any). Formulate an LP whose solution will enable the post office to minimize the cost of meeting its weekly work requirements.
x1 = employees who start on Monday and work 5 consecutive days o1 = employees who start on Monday and work 6 consecutive days (with 1 day overtime). x1 = Start on Monday, x = Start on !uesday".. o1 = Start on Monday, o = Start on !uesday".. min z =(250)(x1+x2+x3+x4+x5+x6+x7)+(312)o1+o2+o3+o4+o5+o6+o7) s.t. (x1 +x4+x5+x6+x7)+(o1 +o4+o5+o6+o7) >= 17 (Monday constraint) s.t. (x1+x2 +x5+x6+x7)+(o1+o2 +o5+o6+o7) >= 13 (Tuesday constraint) s.t. (x1+x2+x3 +x6+x7)+(o1+o2+o3 +o6+o7) >= 15 (Wednesday constraint) s.t. (x1+x2+x3+x4 +x7)+(o1+o2+o3+o4 +o7) >=19 (Thursday constraint) s.t. (x1+x2+x3+x4+x5 )+(o1+o2+o3+o4+o5 ) >= 14 (Friday constraint) s.t. ( +x2+x3+x4+x5+x6 )+( +o2+o3+o4+o5+o6 ) >=16 (Saturday constraint) s.t. ( +x3+x4+x5+x6+x7)+( +o3+o4+o5+o6+o7) >= 11v(Sunday constraint) s.t. All Xs must be integers >= 0.