Feasible Region Calculator - Graph Linear Inequalities
Visualize the feasible region of linear inequalities with our calculator. Graph inequalities, find vertices, and understand bounded and unbounded regions easily.
Enter Inequalities
Input your linear inequalities. For example: 2x+3y<=6, x-y>=1, y<=4.
Feasible Region Analysis
Vertices:
Description:
Understanding Feasible Regions
In linear programming, a feasible region is the set of all points that satisfy all given constraints (inequalities). Each inequality represents a half-plane, and the feasible region is the intersection of these half-planes. This region can be bounded (a polygon), unbounded (extending infinitely), or empty (no solution satisfies all inequalities). The vertices of the feasible region are crucial in optimization problems, as the optimal solution often occurs at one of these vertices. This calculator helps you visualize and analyze these regions for a given set of linear inequalities.