I am a highschool senior that's new to this topic. So, apologies for my lack of knowledge and misconceptions. The proof of the theory of this chapter is beyond the scope of my textbook, so that may be reason why I feel it difficult to do the following question.
Q) Maximize the function $Z=-x+2y$ which is subject to the following constraints:
$$ \begin{align} x\geq 3\\ x+y\geq 5\\ x+2y\geq 6\\ y\geq 0 \end{align} $$
My attempt::
>> Plotting the corresponding lines I get:

>> The intersection of the areas bounded by the inequalities is as shown below.
It can be seen that the feasible region is unbounded:

The corner points that I've found and their corresponding $Z$ values are: $$\begin{array}{|c|c|} \hline \text{Corner Points} & Z=-x+2y\\ \hline A\Big(6,0\Big) & -6 + 0 = -6 \\ \hline B\Big(4,1\Big) & -4 + 2 = -2 \\ \hline C\Big(3,2\Big) & -3 + 4 = 1 \\ \hline D\Big(\infty, \infty\Big) & \text{undefined}\\ \hline \end{array}$$
Obviously, the minimum $Z=-6$ is at $A(6,0)$ but I'm not sure about the maximum. My gut tells me it's $Z=1$ at $C(3,2)$ but I don't know how to prove it to myself. Am I right?
Please guide me in the right direction. How do I answer questions of this nature?
