Identify the feasible-region vertices from linear inequalities.
Last updated: June 2026 | By Patchworkr Team
Constraints
Assumes x ≥ 0 and y ≥ 0. Invalid coefficients are rejected.
Corner Points
Corner points are the vertices of the feasible region where constraint boundaries meet.
Why assume x ≥ 0 and y ≥ 0?
That matches the standard first-quadrant feasible-region setup used in many textbook problems.
Can constraints be negative?
Yes, as long as they parse as numbers and the feasible region is still meaningful.
What if two lines are parallel?
Parallel constraints do not produce an intersection point and are skipped.
What if the region is empty?
The calculator will return no feasible corner points.
Related Tools
Calculate areas of shapes.
Convert area units.
Apply circle theorems.
Convert coordinate systems.
Calculate pyramid properties.
Distance from point to plane.