Because both the objective function and the constraints are strictly linear, which forces the best value to push outward against the boundaries of the feasible region.

Because in a linear program, if an optimal solution exists, at least one optimal solution will occur at a corner point (vertex) of the feasible region.

So instead of checking every possible point, we can check the corner points and compare their objective values.