This paper presents a novel SHOIQ tableau calculus which incorporates algebraic reasoning for deciding ontology consistency. Numerical restrictions imposed by nominals and qualified number restrictions are encoded into a set of linear inequalities. Column generation and branch-and-price algorithms are used to solve these inequalities. Our preliminary experiments indicate that this calculus is more stable and often performs better on SHOIQ ontologies than standard tableau methods.