Feasible Region and Infeasible Region
Important Questions on Feasible Region and Infeasible Region
For the following feasible region, the linear constraints are

For the following linear programming problem: minimize subject to the constraints the solution is

The point which provides the solution to the linear programming problem:
Maximize subject to the constraints: is

The point at which the maximum value of subject to the constraints obtained is

Maximum value of equals subject to is

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

The maximum value of is subject to and is

The shaded region in the figure is the solution set of the inequations

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

For the following shaded region, the linear constraints (except and ) are

The solution for minimising the function under an LPP with constraints and , is

The minimum value of subject to is

The minimum value of subject to constraints is

The minimum value of subject to the constraints and is

For the function to be maximum under the constraints the values of and are

The maximum value of subject to constraints and is

Determine the system of linear inequations for which the solution set is the shaded region in the following figure:

Find the linear inequations for which the shaded area in the following figure is the solution set:

The constraints of LPP corresponds to

Determine the maximum value of , if the feasible region is shown shaded in the figure.

