Step1: Graph the system of inequalities that represents the constraints.

Step 2: Obtain the value of the objective function at each corner of the graphed region.

The maximum and ninimum of the objective function will occur at one or more corner points.

Thus, to find the maximum or minimum values of a linear programming problem, the coordinates of each vertex from the graph representing the constraints need to be substituted in the objective function.

Hence, the given statement makes sense.