Graphical Method Calculator

Visualize 2-variable linear programming problems with an interactive graph.

Objective Function (Z)

Z =
x
+
y

Constraints

#1
x
+
y
#2
x
+
y
#3
x
+
y
4.28.312.516.620.824.929.133.237.441.54.69.213.818.423.027.632.236.841.446.0

Optimal Solution

Z = 33.0000
x = 3.0000
y = 12.0000

How it works

The graphical method engine computes every possible intersection between the constraint lines and the axes (x = 0, y = 0).

Each candidate vertex is then strictly tested against the original inequalities. Because the algebraic evaluation uses the original coefficients directly (val = a · x + b · y), it natively handles negative coefficients and flips in inequality directions correctly without requiring any special casing or manual inequality reversals.