SOLUTION: graph each system of constraints. find all vertices. evaluate the objective function at each vertex to find teh maximum or minimum value..:)
*** all the < and > have lines under
Algebra.Com
Question 176608: graph each system of constraints. find all vertices. evaluate the objective function at each vertex to find teh maximum or minimum value..:)
*** all the < and > have lines under neath them.. so all the arrows are equal or greater than...
1)x<3
y<7
x>0,y>0
maximum for p=2x+3y
2) 2x+y<30
x+y<20
x>0, y>0
minimum for c=x+4y
Answer by Fombitz(32388) (Show Source): You can put this solution on YOUR website!
1)
Max. value=27 occuring at (3,7), min. value =0 occuring at (0,0).
.
.
.
2)First find the feasible region bounded by the lines,
.
.
.
.
.
.
Let's look at the graph of the two lines.
The vertices are then the x-intercept and y-intercept of the graphs.
Y-intercept: (0,20)
X-intercept: (15,0)
The final point is their intersection point.
The minimum for C=x+4y is 0 and occurs at (0,0).
RELATED QUESTIONS
Graph each system of constraints. Find all vertices. Evaluate the objective function at... (answered by Fombitz)
Graph each system of constraints. Find all vertices. Evaluate the objective function at... (answered by Fombitz)
Assume that you graph a system of constraints and find vertices (0,8), (9,4), (8,5), and... (answered by ikleyn)
An objective function and a system of linear inequalities representing constraints are... (answered by KMST)
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)
Use the graphical method to solve the following linear programming problem. Restrict x... (answered by Edwin McCravy)
a. find the value of the objective function at each corner of the graphed region.
b.... (answered by KMST)
I am definitely confused and can't understand, if you can please explain in detailed... (answered by Fombitz)