# Cone of optimality

Given an LP in standard form, let $LaTeX: B$ be an optimal basis (for which the dual is feasible). Then, the cone of optimality of $LaTeX: B$ is $LaTeX: {b : B^{-1}b& \ge 0}$. It is so called because $LaTeX: B$ remains an optimal basis for any $LaTeX: b$ in this cone.