The Simplex Methoding Method: The Simplex Solution Method
b. c. d. e.
Formulate the dual of this model. Define the dual variables and indicate their value. Determine the optimal ranges for c1 and c2. Determine the feasible ranges for q1 (pounds of brass) and q2 (labor hours). What is the maximum price the company would be willing to pay for additional labor hours, and how many hours could be purchased at that price?
43. The Southwest Foods Company produces two brands of chili—Razorback and Longhorn—from several ingredients, including chili beans and ground beef. The number of 100-gallon batches of Razorback chili (x1) and Longhorn chili (x2) that can be produced daily is constrained by the availability of chili beans and ground beef, as shown in the following linear programming model: maximize Z = 200x1 + 300x2 (profit, $) subject to 10x1 + 50x2 … 500 (chili beans, lb.) 34x1 + 20x2 … 800 (ground beef, lb.) x1, x2 Ú 0 The final optimal simplex tableau for this model is as follows:
cj 300 200
Basic Variables x2 x1 zj cj - zj
200 Quantity 6 20 5,800 x1 0 1 200 0
300 x2 1 0 300 0
0 s1 17/750 -1>75 310/75