This is a Linear Programming problem. Maximize the function: .
with the following constraints: .
You should have been shown the approach by now . . .
Graph the inequalities; shade the appropriate regions.
Determine the vertices of the resulting polygon.
Test the vertices (coordinates) in the given function.
The graph should look like this:
1 o - - o - -
- o - - - - o - -
Determine the four vertices.
You should get: .
Now see which one produces maximum