Hello again, daniel4616!
Here's #6 . . . in baby-steps . . .
6. Maximize

subject to:
We must graph and shade the inequalities.
places us in the first quadrant.
![[2]\;-x + y \:\leq \:2](http://latex.codecogs.com/png.latex?[2]\;-x + y \:\leq \:2)
Graph the line: 
It has intercepts:
. . Sketch the line.
Solve for
and note the inequality: . 
Since the inequality is
, shade the region below the line. Code:
| *:
| *::::
| *:::::::
2*::::::::::
* |:::::::::::
- - * - + - - - - - - - -
-2 |
![[3]\;3x + y \:\leq \:18](http://latex.codecogs.com/png.latex?[3]\;3x + y \:\leq \:18)
Graph the line 
It has intercepts: ,\;(0,18))
Since we have:
, we shade below the line. Code:
|
18*
|*
|:*
|::*
|:::*
|::::*
|:::::*
|::::::*
- + - - - *- -
| 6
Of course, we graph these region on the same graph.
And the final shaded region looks like this.
(Note the vertices of the region.) Code:
|
| *(4,6)
| *::*
(0,2)*:::::*
|:::::::*
- - * - - - - * - -
(0,0) (6.0)
We find the intersection of the two slanted lines
. . by solving the system: 
and we get: 
The vertices are the only "critical values" we are concerned with.
Test them in the z-function to see which gives a maximum value.
:\;z\:=\:2\!\cdot\!0 - 3\!\cdot\!0\:=\:0)
:\;z\:=\:2\!\cdot\!6 - 3\!\cdot\!0\:=\:12\quad\Leftarrow\;maximum!)
:\;z\:=\:2\!\cdot\!0 - 3\!\cdot\!2\:=\:-6)
:\;z\:=\:2\!\cdot\!4 - 3\!\cdot\!6\:=\:-10)
Answer: .
to maximize
.
-----