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 ->
College
-> Linear Algebra
-> 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
Log On
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...
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).