Register
The points (8, 0), (0, 9), (0, 0), and (6, 5) are the vertices of a feasible region for a linear programming problem. The objective function for the problem is C = 1.5x + 3.5y. Which point is the maximum
27.4k views
19 votes
The points (8, 0), (0, 9), (0, 0), and (6, 5) are the vertices of a feasible region for a linear programming problem. The objective function for the problem is C = 1.5x + 3.5y. Which point is the maximum value of C?

User Daniel Rodrigues
by
3.6k points

1 Answer

9 votes

Answer:

the point 6,5 is the maximum Value of c out of the other points

User Brijesh Lakkad
by
4.7k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

4.4m questions

5.7m answers

Other Questions

Before beginning voice lessons, Aubrey already knew how to sing 357 pieces, and she expects to learn 2 new pieces during each week of lessons. After 78 weeks of voice lessons, how many pieces will Aubrey
A study was completed in Florida. In southern Florida, the study involved 3,000 patients; 54% of them experienced flulike symptoms during the same month. The study had a margin of error of 1.8%. What does
Solve for x in the equation 3 x squared minus 18 x + 5 = 47. (I need this to be an answer like X=3+\_ square root 23)
Please answer asap.......... ...
Can someone help me plz I have to Turn 27/9 in simplest
Link Copied!