In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified technical conditions. For a polyhedron and a vector , is a basic solution if: All the inequality constraints defining are active at.