Given a polyhedron, $P\subset \mathbb{R}^2$, I am to show that the inequality $\alpha_{1}x+\alpha_{2}y\geq \beta$ holds true for all $\binom{x}{y}\in P$, if and only if the inequality holds true for all extreme points in $P$.
The first part is rather simple, since the extreme points are part of the polyhedron, and therefore part of "all points in $P$", thus the inequality holds for the extremes aswell.
I am having trouble showing the other way around, that if the inequality holds true for all extreme points in $P$, it implies that it holds true for all points in $P$.
Bear in mind that it is still early on in the course, so we haven't learned many theorems and such to apply yet.
One of the things we have learned however, is that any bounded polyhedron is the convex hull of its extreme points, which I am unsure of whether I can use in this context.
Any help is appreciated.
The inequality $\alpha_1x+\alpha_2y\geq\beta$ describes geometrically all points in the plane that lie on one side of the line $\alpha_1x+\alpha_2y=\beta$. If all extreme points lie on that same side, then since that side is a convex half plane, it follows that their convex hull also lies in that same half-space.