A nonnegative basic solution to a set of (m × n) linear equations Axv = bv, where m ≤ n. The major importance of basic feasible solutions is that, for a linear-programming problem, they correspond to extreme points of the convex set of solutions. The simplex algorithm moves through a sequence of adjacent extreme points (basic feasible solutions).  Adjacent extreme points; Basic solution.