9-47: Show how the nonconvex shaded solution spaces in Figure 9.8 can be represented by a set of simultaneous constraints. Find the optimum solutions that maximizes $z = 2x_1 + 3x_2$ subject to the solution space given in (a). FIGURE 9.8 Solution Spaces for Problem 9-47
Added by Consuelo J.
Close
Step 1
8(a). The shaded region in the graph is bounded by the following lines: 1. \( x_1 = 0 \) 2. \( x_2 = 0 \) 3. \( x_2 = 3 - x_1 \) 4. \( x_1 = 2 \) Show more…
Show all steps
Your feedback will help us improve your experience
Pravin N and 62 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
Sri K.
What is the optimal solution? Given the linear programming problem: Maximize 6x1 + 4x2 subject to 6x1 + 10x2 = 90 12x1 + x2 = 42 Transform the (=) constraints into equations; Enumerate all solutions for which two variables have been set equal to 0. From part b, identify the basic feasible solutions in the original constraint set and confirm that the basic feasible solutions are graph corner points on the area of feasible solutions. What is the optimal solution?
Matthew W.
In Exercises 7-12, find the minimum and maximum values of the objective function and where they occur, subject to the indicated constraints. (For each exercise, the graph of the region determined by the constraints is provided.) Objective function: $ z = 40x + 45y $ Constraints: $ \hspace{1cm} x \ge 0 $ $ \hspace{1cm} y \ge 0 $ $ 8x + 9y \le 7200 $ $ 8x + 9y \ge 3600 $
Systems of Equations and Inequalities
Linear Programming
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD