basic feasible solution

A vertex of an LP's feasible region, in standard form — as many variables set to zero as there are extra degrees of freedom.

In an LP's standard form $Ax=b,\ x\ge0$ with $A$ an $m\times n$ matrix ( $m<n$ ), a basic feasible solution picks $m$ "basic" variables (a linearly independent set of columns of $A$ ) to solve for, sets the remaining $n-m$ "nonbasic" variables to $0$ , and checks the result is feasible ( $x\ge0$ ). Every basic feasible solution corresponds to a vertex of the feasible polyhedron, and vice versa.

Read the full section →

snap pen only

Graph settings

indep dep deg

grid intersections

xmin xmax ymin ymax

x-tick y-tick

Calculator