I have the linear programming problem as follows
subject to $x+3y \le 14$, $2x+y \le 8$, $x,y \ge 0$
If you solve this graphically then you can see a feasibility region with four extreme points, of which one of them is the optimal solution.
I am wondering if it is possible to show that there is EXACTLY one solution. I have been reading lots and found lots of proofs that if an optimal solution exists (which it does here), then there exists an optimal solution at an extreme point (vertex).
I have also found a theorem that says if the feasibility region is a compact convex set (which it is here), then the optimal solution is at a vertex.
I understand why none of these theorems state that the only optimal solution is at a vertex, as there are clearly cases where there are infinite optimal solutions on an edge between two extreme points. But that is not the case here as only one of the extreme points is an optimal solution.
It may not even be possible (I haven't been asked to do this so might be flogging a dead horse as they say), but is there any way to show that the point (4,0) (which is the optimal solution here) is the ONLY point where the objective function is maximised?
To explain what I mean further: I can prove that this is an optimal solution as I can prove that if an optimal solution exists, then there exists an optimal solution at an extreme point. And none of the other extreme points give the maximum value for the objective function. But how can I know for sure that the same maximum is not reached at some other point in the feasibility region (e.g. somewhere in the middle, or on a boundary line)? I can explain intuitively about contour lines etc. but I want to actually prove it.
Thank you in advance!