Feasible Region and Infeasible Region
Feasible Region and Infeasible Region: Overview
This topic covers concepts, such as, Feasible Region of a Linear Programming Problem, To Find the Vertices of a Feasible Region Algebraically (Without Drawing a Graph) & Linear Programming Problems Having Infeasible Solution etc.
Important Questions on Feasible Region and Infeasible Region
The feasible region for an is shown shaded in the figure. Determine the maximum and minimum values of .

Which of the following is not a vertex of the feasible region bounded by the inequalities and .

The feasible solution of a belongs to

The shaded part of given figure indicates the feasible region, then the constraints are

Determine the minimum value of (if any), if the feasible region is shown shaded in the figure.

The vertex of common graph of inequalities and , is

The shaded part of given figure indicates the feasible region
Then the constraints are

The feasible region for an is shown shaded in the figure. Determine the maximum and minimum values of .

The co-ordinates of the point for minimum value of subject to the conditions is

The coordinates of the corner points of the bounded feasible region are and . the maximum of objective function is

The region of feasible solution under the constraints is:

The minimum value of subject to is

The maximum value of subjected to constraints , , , is

The maximum value of subject to constraints is

The minimum value of subject to the constraints is

The maximum value of subject to the constraints is

The minimum value of the function subject to the constraints is

Shaded region is represented by is

The minimum values of subject to the constraints is

By graphical method, the solution of linear programming problem :
Maximize Subject to is
