Solve the linear programming problem. (If there is no solution, enter NO SOLUTION.) Maximize 2 = 3x + Y Subject to x +y < 201 Sx + Y < 245 Y 2 25 X,Y 2 0 The maximum value of 2 is at (x, Y) )
Added by Martin L.
Close
Step 1
Graph the constraints: x + y < 201 Sx + y < 245 x, y > 0 The feasible region is the shaded area below: Show more…
Show all steps
Your feedback will help us improve your experience
Aman Gupta and 80 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Sri K.
Solve the linear programming problem. (If there is no solution, enter NO SOLUTION.) Maximize z = 4x + y Subject to x + y ≤ 81 3x + y ≤ 117 y ≥ 28 x, y ≥ 0 The maximum value of z is at (x, y) = ( , ).
Madhur L.
Solve the linear programming problem using the simplex method. Maximize M = x + 3y + 7z subject to x + 4z <= 20, 3y + z <= 21, x, y, z >= 0. Find the solution. x = y = z = M =
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Watch the video solution with this free unlock.
EMAIL
PASSWORD