6:18 Snapchat bartleby.com 1... / Q&A LIb... Linear programming proble... 18 of 30 questions left until 10/18/19 estion Solve the linear programming problem by the method of corners. C 3x 4y Minimize y 42 y 30 х + Зу 2 30 x2 0, у 2 0 subject to 4x + 2х + at (x, y) The minimum is C = ted Probability Q&A answers to questions asked Show Q&A udent like you LL

(8,9)(10,0)

This extreme value problem has a solution with both a maximum value and a minimum value. Use Lagrange multipliers to find the extreme values of the function subject to the given constraint. f(x, у) 3D 4x + 8y; х? + у2 = 20 maximum value minimum value

C=-40) 2. Write a piece-wise function for the following graph. Hint: find linear equations for each "piece" of the function with its associated domain restriction. Page Section 1.3-14 Lab МАT 171 ance tra Capacity Ring aper than round ring рарer nteed t stick available in most versions and close with one touch transfer, non-stick material material is PVC FREE ide binders for covering extra-wide dividers. 697124

Use a graphing calculator or a computer program for the simplex method to solve this linear programming problem. S1 $2 X4 .625 1 0 .5 .375 0 1 0 0 0 0 X1 0 0 1 X2 X3 0 .375 .75 .25 125 0 -105-80 -75 - 65 S3 = 0 530 0 630 1 280 0 0 The optimal solution X₁ = ‚ X₂ = ₁ ×3 = (Do not round until the final answer. Then round to the nearest integer as needed.) and X4 = produces the maximum value

Find an objective function z that has a maximum value at the indicated vertex of the constraint region shown. (There are many correct answers.) The maximum occurs at vertex B. z =_______

Graph the constant-cost lines for the objective function C = 4x+ 5 y through (8,8) and also through (12,12). Use a straightedge to identify the corner point where the minimum cost occurs. Confirm your answer by constructing a corner point table. 15+ (0,15) (0,11) 10-1 5- (2,3) T 5 (12,12) (8,8) (15,15) 10 (15,0) Q Q M Which graph below has the correct constant-cost lines? O A. O B. 15 10- O C. 15+ 10-1 5- 5 10 15 5 10 15 Q M Q 37 15 10- 5- O D. 15- 10- 5- 5 10 15 -10 5 '10' 15 Q Q Q 37