This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: to clean and package the fish. The graph below represents the feasible region for this linear programming model. What are the coordinates of the vertices of the feasible region, and what are the vales of t and s that maximize the objective function? ; P = 2.50 t + 2.80 s CORRECT: (0, 0), (0, 53), (71.76, 0), (28, 46); t = 28 and s = 46. 4. Which of the following are the values of x and y that minimize the objective function for this system of constraints? ; P = x + 2 y CORRECT: ( , 2) 5. Identify the graph of the system of constraints. Then find the values of x and y that mazimize the objective function. Maximum for C = 30 x + 50 y INCORRECT: Maximum at (0, 7); 350 CORRECT: Maximum at (0, 4); 200 You got 4 out of 5 correct....
View Full Document
- Spring '10