1. Solve the following linear programming model graphically: Maximize $4x_1 + 10x_2$ Subject to: $c_1: -5x_1 + x_2 le 0$ $c_2: -14x_1 + 11x_2 ge 0$ $c_3: 5x_1 + x_2 le 120$ $c_4: x_1 ge 12$ $x_1, x_2 ge 0$ (a) Create a graph clearly showing the feasible region. (b) Find the optimal decision variables and calculate the objective function value. Which constraints are binding? (c) The constant for decision variable $x_1$ is known to change over time. What is the maximum value the constant for $x_1$ can grow before the optimum point found in part (b) stops being optimum? (d) Constraint $c_3$ represents the availability of space to manufacture items $x_1$ and $x_2$. A project is proposed to expand the available space by 10 units. Should the project be undertaken? (e) Suppose both $x_1$ and $x_2$ are constrained to be integer numbers. What are the new optimum decision variables and the corresponding objective function value?
Added by Holly M.
Close
Step 1
Step 1: Rewrite the constraints in standard form: -581 - 82 + 14r1 - 11r2 ≤ -501 -12r1 + r2 ≤ 0 r1, r2 ≥ 0 Show more…
Show all steps
Your feedback will help us improve your experience
Carson Merrill and 66 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
Solve the linear programming problem. Select the correct choice below and fill in any answer boxes present in your choice. What is the minimum value of z? Minimize and maximize z = 10x + 40y There is no minimum value of z. Subject to 2x + y ≥ 56 x + y ≥ 40 x + 2y ≥ 48 x, y ≥ 0 Select the correct choice below and fill in any answer boxes present in your choice. What are the coordinates of the corner point where the minimum value of z occurs? The coordinates are There is no minimum value of z. Select the correct choice below and fill in any answer boxes present in your choice. What is the maximum value of z? There is no maximum value of z. Click to select and enter your answer(s).
Madhur L.
Consider the following linear programming problem: Maximize z = 4x1 + x2 Subject to: 3x1 + x2 <= 6 5x1 + 3x2 <= 15 x1, x2 >= 0 a) Find a range of values on the coefficient of x1 in the objective function for which the current basis remains optimal. b) Find a range of values on the coefficient of x2 in the objective function for which the current basis remains optimal. c) Find the range of values for the RHS of the first constraint for which the current basis remains optimal. Determine the new optimal solution if the RHS is 6+Δ. d) Find the range of values for the RHS of the second constraint for which the current basis remains optimal. Determine the new optimal solution if the RHS is 15+Δ. e) If the RHS of the first constraint is 8, what is the new optimal objective function value?
Sri K.
Consider the following linear program. Max 3A + 2B s.t. 1A + 1B ≤ 10 3A + 1B ≤ 22 1A + 2B ≤ 18 A, B ≥ 0 (a) Use the graphical solution procedure to find the optimal solution. What is the value of the objective function at the optimal solution? ____________ at (A, B) = ____________ (b) Assume that the objective function coefficient for A changes from 3 to 5. Use the graphical solution procedure to find the new optimal solution. Does the optimal solution change? The extreme point ______________________ ---Select---remainsbecomes optimal. The value of the objective function becomes __________________________ (c) Assume that the objective function coefficient for A remains 3, but the objective function coefficient for B changes from 2 to 4. Use the graphical solution procedure to find the new optimal solution. Does the optimal solution change? The extreme point ____________ ---Select---remainsbecomes optimal. The value of the objective function becomes ______________________
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