how to determine the feasible region in linear programming???

The feasible region determined by a collection of linear inequalities is the collection of points that satisfy all of the inequalities.

To sketch the feasible region determined by a collection of linear inequalities in two variables:

Sketch the regions represented by each inequality on the same graph, remembering to shade the parts of the plane that you want. The intersection of all the shaded parts is your required feasible region.