Satisfiability in Rationals and Linear Programming An exploration of the deep theoretical connection between satisfiability problems over rational arithmetic and linear programming, covering LP relaxations, complexity theory, and SMT solvers. 2026-03-08