terican

Last verified · v1.0

Calculator · math

Corner Point Calculator (Intersection Of Two Lines)

Find the exact corner point where two linear equations intersect. Enter six coefficients in standard form to instantly compute x, y coordinates or distance from origin.

FreeInstantNo signupOpen source

Inputs

Corner Point Value

—

Explain my result

0/3 free

Get a plain-English breakdown of your result with practical next steps.

Corner Point Value—

The formula

How the
result is
computed.

What Is a Corner Point Calculator?

A corner point calculator finds the exact (x, y) intersection of two straight lines given in standard form a₁x + b₁y = c₁ and a₂x + b₂y = c₂. In linear programming, the optimal solution to any maximization or minimization problem always occurs at one of these corner points—also called vertices—of the feasible region. Rather than graphing lines by hand or working through multi-step algebra, users enter six coefficients and receive precise intersection coordinates in seconds.

The Formula: Cramer’s Rule Applied

The calculator applies Cramer’s Rule, a closed-form determinant method for solving 2×2 linear systems. Given two equations in standard form, the intersection coordinates are:

  • x-coordinate: x = (c₁b₂ − c₂b₁) ÷ (a₁b₂ − a₂b₁)
  • y-coordinate: y = (a₁c₂ − a₂c₁) ÷ (a₁b₂ − a₂b₁)

The shared denominator D = a₁b₂ − a₂b₁ is the determinant of the 2×2 coefficient matrix. A non-zero determinant guarantees one unique intersection point. When D = 0, the lines are parallel or coincident and no unique corner point exists.

Variable Definitions

  • a₁ — Coefficient of x in the first equation (a₁x + b₁y = c₁)
  • b₁ — Coefficient of y in the first equation
  • c₁ — Constant on the right-hand side of the first equation
  • a₂ — Coefficient of x in the second equation
  • b₂ — Coefficient of y in the second equation
  • c₂ — Constant on the right-hand side of the second equation
  • D — Determinant: a₁b₂ − a₂b₁ (denominator for both coordinates)

Step-by-Step Worked Example

Consider two constraint boundaries from a production planning model:

  • Line 1 (labor hours): 2x + 3y = 12, so a₁ = 2, b₁ = 3, c₁ = 12
  • Line 2 (material units): x + y = 5, so a₂ = 1, b₂ = 1, c₂ = 5

Step 1 — Compute the determinant: D = (2)(1) − (1)(3) = 2 − 3 = −1

Step 2 — Solve for x: x = (c₁b₂ − c₂b₁) ÷ D = (12 × 1 − 5 × 3) ÷ (−1) = (12 − 15) ÷ (−1) = 3

Step 3 — Solve for y: y = (a₁c₂ − a₂c₁) ÷ D = (2 × 5 − 1 × 12) ÷ (−1) = (10 − 12) ÷ (−1) = 2

The corner point is (3, 2). Verification: 2(3) + 3(2) = 12 ✔ and 3 + 2 = 5 ✔. The distance from the origin to this vertex is √(3² + 2²) = √13 ≈ 3.606 units.

Why Corner Points Matter in Linear Programming

The Corner Point Theorem states that if a linear objective function attains an optimal value over a bounded convex feasible region, that optimum occurs at a vertex of the region. According to the Richland Community College Linear Programming Corner Point Table, every bounded feasible region formed by linear constraints has a finite set of vertices, and evaluating the objective function at each vertex is sufficient to identify the global optimum—no calculus required. The University of Wisconsin–Madison COMAP Linear Programming Guide demonstrates that a feasible region defined by m linear constraints can produce up to m(m−1)/2 pairwise intersection candidates; for just 5 constraints, that means up to 10 corner point calculations. Automating each calculation with this tool eliminates the tedious algebra and reduces arithmetic errors.

Real-World Applications

  • Operations research: Maximizing profit subject to labor, machine time, and raw material constraints
  • Nutrition science: Minimizing dietary cost while satisfying minimum nutrient requirements
  • Manufacturing: Optimizing the production mix for two products sharing limited machine capacity
  • Finance: Allocating a portfolio between two assets under return and risk budget constraints
  • Transportation logistics: Minimizing shipping cost across two overlapping regional supply boundaries

Special Cases to Watch

When D = a₁b₂ − a₂b₁ = 0, the two lines share the same slope. Parallel lines (same slope, different intercepts) never intersect, meaning no corner point exists for that constraint pair. Coincident lines (same slope, same intercept) overlap entirely and produce infinitely many solutions. In both cases division by zero is undefined, and the calculator alerts users rather than returning an erroneous result.

Reference

Frequently asked questions

What is a corner point in linear programming?
A corner point (also called a vertex or extreme point) is the intersection of two or more constraint boundary lines that define the feasible region of a linear programming problem. The Corner Point Theorem guarantees that if a linear objective function has an optimal value over a bounded feasible region, that value occurs at one of these vertices. For example, in a production planning problem with two products and two resource constraints—such as 4x + 2y ≤ 20 and x + 3y ≤ 15—the maximum profit is found by evaluating the objective function at each corner point, not at interior points.
How do you find the intersection of two lines using Cramer's Rule?
Rewrite both lines in standard form a₁x + b₁y = c₁ and a₂x + b₂y = c₂, then compute D = a₁b₂ − a₂b₁. Solve x = (c₁b₂ − c₂b₁) ÷ D and y = (a₁c₂ − a₂c₁) ÷ D. For example, given 3x + 2y = 11 and x + 4y = 13, D = (3)(4) − (1)(2) = 10. Then x = (11 × 4 − 13 × 2) ÷ 10 = 18 ÷ 10 = 1.8 and y = (3 × 13 − 1 × 11) ÷ 10 = 28 ÷ 10 = 2.8. The corner point is (1.8, 2.8).
What does it mean when the determinant equals zero in the corner point formula?
When D = a₁b₂ − a₂b₁ = 0, both lines have identical slopes and no unique intersection exists. If the lines are parallel (same slope, different y-intercepts), the system is inconsistent and produces no corner point—these constraint boundaries never meet. If the lines are coincident (same slope, same intercept), the system is dependent with infinitely many solutions along the shared line. Division by zero is undefined in Cramer’s Rule, so the calculator detects D = 0 and displays a warning instead of attempting the calculation.
How is the distance from the origin to a corner point calculated?
The straight-line distance from the origin (0, 0) to a corner point (x, y) uses the Euclidean distance formula: d = √(x² + y²). For corner point (3, 4), the distance is √(9 + 16) = √25 = 5 units exactly. For corner point (3, 2), d = √(9 + 4) = √13 ≈ 3.606 units. This output option is useful in geometry problems where the objective function measures Euclidean distance, or when comparing how far each feasible vertex lies from a reference origin point.
Can the corner point calculator handle equations in slope-intercept form (y = mx + b)?
Yes, but first convert each equation to standard form. To rewrite y = mx + b as a₁x + b₁y = c₁, move the mx term: −mx + y = b, so a = −m, b = 1, and c = the intercept value. For example, y = 2x + 3 becomes −2x + y = 3 (a = −2, b = 1, c = 3) and y = −x + 5 becomes x + y = 5 (a = 1, b = 1, c = 5). Enter these six converted coefficients into the calculator to find the intersection coordinates.
Why does the optimal solution of a linear program always occur at a corner point?
A linear objective function such as P = 5x + 3y changes at a constant rate in every direction, so its level curves are parallel lines that shift uniformly across the feasible region. Because the feasible region is a convex polygon, these shifting level curves first make contact with the region at a vertex as they move toward the optimal direction. The Corner Point Theorem, covered in the University of Wisconsin–Madison COMAP Linear Programming guide and standard finite mathematics curricula, formalizes this: for any bounded convex feasible region, the linear maximum and minimum must occur at extreme points (corner points), never strictly in the interior.