Consider the following Linear Programming problem: Maximize 2X1+ 6X2 Subject to -10X1-15X2 >= -150 5X1+11X2 >= 55 1X1- 1X2 <= 0 X1 <= 4 1X2 <= 8 X1, X2 >= 0 Answer the following questions: (a) Graph the above constraints on the graph paper provided on the next Page and clearly identify the feasible area where all the constraints are satisfied. (b) Specify the optimal solution and the maximum value of the objective function.
Added by Karen C.
Close
Step 1
-JOX1 - 15X2 >= -150 can be rewritten as X2 <= (-1/15)X1 + 10 SX1 + 11X2 <= 110 can be rewritten as X2 <= (-1/11)X1 + 10 1X1 - 1X2 <= 4 can be rewritten as X2 >= X1 - 4 1X2 <= 8 Now we can plot these lines on the graph paper provided. Show more…
Show all steps
Your feedback will help us improve your experience
Keondre Parker and 80 other Calculus 3 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
Consider the following linear programming problem Min 4X + 2Y ST 3X + Y >= 6 2X - Y >= 6 4X + 3Y >= 12 X, Y >= 0 Draw the feasible region for the above linear programming Identify the optimal solution point on your graph What are the values of X and Y at the optimal solution? What is the optimal value of the objective function?
Sri K.
Solve the linear programming problem Maximize using the simplex method 2x1 + 5x2 subject to 5x1 + x2 ≤ 50, 5x1 + 2x2 ≤ 70, x1 + x2 ≤ 60, and x1, x2 ≥ 0. Select the correct choice below and if necessary fill in the answer box to complete your choice: A) The maximum is z = [ ] when x1 = [ ], x2 = [ ], s1 = [ ], s2 = [ ], and s3 = [ ]. B) There is no maximum solution for this linear programming problem.
Madhur L.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD