Consider a bounded standard maximum problem in two variables whose feasible region is of the form:

where the constants \(b_{i}\) are non-negative. Give a geometric argument that a feasible point can be written as the convex combination of at most three corner points.

a11 x1 + 912x2 < b am1x1 am 2x2 < bm X1, X20