Corner Point Calculator
The Corner Point Calculator finds where two lines intersect — a key step in linear programming for locating feasible-region corner points. Enter each line as a₁x + b₁y = c₁.
Formula
Solve a₁x + b₁y = c₁ and a₂x + b₂y = c₂ simultaneously
- Corner points are where constraint lines meet in linear programming.
- Parallel lines (zero determinant) do not produce a single corner point.
x + y = 4, 2x + y = 5
Inputs
- a₁: 1
- b₁: 1
- c₁: 4
- a₂: 2
- b₂: 1
- c₂: 5
Intersection at (1, 3).
Frequently asked questions
Why find corner points?
In linear programming the optimal value of a linear objective occurs at a corner point of the feasible region.