Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
Since the feasible region is closed and bounded, we know that the maximum value will occur at ---Select--- . Thus, we test the corner points in the objective function. Corner f = 8x + 9y (0, 8) (4, 8) (6, 6) (9, 0) (0, 0) Thus, the maximum value of the function is which occurs at the point

Since the feasible region is closed and bounded, we know that the maximum value will occur at ---Select--- . Thus, we test the corner points in the objective function. Corner f = 8x + 9y (0, 8) (4, 8) (6, 6) (9, 0) (0, 0) Thus, the maximum value of the function is which occurs at the point

College Algebra
College Algebra
7th Edition
ISBN:9781305115545
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:James Stewart, Lothar Redlin, Saleem Watson
Chapter5: Systems Of Equations And Inequalities
Section: Chapter Questions
Problem 1P
See similar textbooks
icon
Related questions
Question
100%

The question is the step 2 portion.. included 2nd image to fill in gaps

Since the feasible region is closed and bounded, we know that the maximum value will occur at ---Select--- v. Thus, we test the corner points in the objective function. Corner f = 8x + 9y (0, 8) (4, 8) (6, 6) (9, 0) (0, 0) Thus, the maximum value of the function is which occurs at the point
Transcribed Image Text:Since the feasible region is closed and bounded, we know that the maximum value will occur at ---Select--- v. Thus, we test the corner points in the objective function. Corner f = 8x + 9y (0, 8) (4, 8) (6, 6) (9, 0) (0, 0) Thus, the maximum value of the function is which occurs at the point
Solve the following linear programming problem. Restrict x 2 0 and y 2 0. Maximize f = 8x + 9y subject to x + y < 12 2x + y s 18 y < 8. Step 1 We want to maximize the function f = 8x + 9y subject to x + y < 12 2x + y < 18 y < 8 x2 0, y 2 0. We start by graphing the feasible region given by the set of inequalities. Thus, we graph the equations x + y = 12, 2x + y = 18, and y = 8 as solid solid lines. Notice that the test point (0, 0) satisfies %3D satisfies all of the given inequalities, so the solution of the constraint system is the region on or below below the lines, in the first quadrant (since x > 0, y 0). 20 Graph Layers 19 18 After you add an object to the graphiyou 16 properties. 15 14 13 12 11 10 7. 6. 4 3. 2 6. 8 9 10 11 12 13 14 15 16 17 18 19 20 Show Help Key
Transcribed Image Text:Solve the following linear programming problem. Restrict x 2 0 and y 2 0. Maximize f = 8x + 9y subject to x + y < 12 2x + y s 18 y < 8. Step 1 We want to maximize the function f = 8x + 9y subject to x + y < 12 2x + y < 18 y < 8 x2 0, y 2 0. We start by graphing the feasible region given by the set of inequalities. Thus, we graph the equations x + y = 12, 2x + y = 18, and y = 8 as solid solid lines. Notice that the test point (0, 0) satisfies %3D satisfies all of the given inequalities, so the solution of the constraint system is the region on or below below the lines, in the first quadrant (since x > 0, y 0). 20 Graph Layers 19 18 After you add an object to the graphiyou 16 properties. 15 14 13 12 11 10 7. 6. 4 3. 2 6. 8 9 10 11 12 13 14 15 16 17 18 19 20 Show Help Key
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Paths and Circuits
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS