Question

How do you find the maximum and minimum of a feasible region $?$

Answer 1

Feasible region of linear programming optimization problems contains the set of points which satisfies the constraints.

Linear programming deals with the optimization (maximization or minimization) of linear functions subjected to linear constraints.

In general LPP, the expression means that any specific problem each constraint may take one of the three possible forms: $\ge ,=,\le .$

Where, maximum or minimum value of LPP problem over the set of feasible solutions depends on the graphed points.

Hence, in this way we can find the maximum and minimum of a feasible region.