Why are the corners enough here? Every point of this bounded feasible polygon is a convex combination of its vertices. A linear objective has the same weighted-average property. It cannot beat every vertex used in that average. Calculate the objective at all four listed corners. The values are zero, seven point five, nine, and eight. The largest is nine at one, three.
