JEE Main & Advanced Mathematics Linear Programming To Find The Vertices of Simple Feasible Region Without Drawing a Graph

To Find The Vertices of Simple Feasible Region Without Drawing a Graph

Category : JEE Main & Advanced

(1) Bounded region: The region surrounded by the inequations \[ax+by\le m\] and \[cx+dy\le n\] in first quadrant is called bounded region. It is of the form of triangle or quadrilateral. Change these inequations into equations, then by putting \[x=0\] and \[y=0,\] we get the solution. Also by solving the equations we get the vertices of bounded region.

 

 

The maximum value of objective function lies at one vertex in limited region.

 

 

(2) Unbounded region : The region surrounded by the inequations \[ax+by\ge m\] and \[cx+dy\ge n\] in first quadrant, is called unbounded region.

 

 

Change the inequation in equations and solve for \[x=0\]and \[y=0\]. Thus we get the vertices of feasible region.

 

 

The minimum value of objective function lies at one vertex in unbounded region but there is no existence of maximum value.


You need to login to perform this action.
You will be redirected in 3 sec spinner