SOLUTION: on a feasible region whose vertices ar{(0, 0), (1, 12), (5, 8), (8, 3), (9, 0) what is the maximum of the objective function p=6x+4y, and where does it occur?
Algebra.Com
Question 616985: on a feasible region whose vertices ar{(0, 0), (1, 12), (5, 8), (8, 3), (9, 0) what is the maximum of the objective function p=6x+4y, and where does it occur?
Answer by solver91311(24713) (Show Source): You can put this solution on YOUR website!
Substitute the coordinate values for each of your feasible region vertices and calculate the value of the objective function for each one. The largest one is the maximum of the objective. If two adjacent points have the same objective function value, then any point on the segment that joins those two points is an optimum.
John
My calculator said it, I believe it, that settles it
RELATED QUESTIONS
Given the system of constraints, name all vertices of the feasible region. then find... (answered by Solver92311)
x + y greater than or equal to 8
x + 5y greater than or equal to 20
x greater than or (answered by Fombitz)
1 (a) Using a scale of 2 cm=10 units on both axes, graph the feasible region... (answered by Alan3354)
Find the coordinates of the vertices of the feasible region. Clearly show how each... (answered by solver91311)
I really would like someone to show me how to graph this problem:
{y < = -x+6
x-2y > = (answered by solver91311)
the feasible region of a maximization problem shown is determined by: 12x+5y<180 5x+4y<98 (answered by stanbon)
4x + 3y greater than or equal to 30
x + 3y greater than or equal to 21
x greater than (answered by KMST)
Solve the given LP problem. If no optimal solution exists, indicate whether the feasible... (answered by greenestamps)
An objective function and a system of linear inequalities representing constraints are... (answered by KMST)
