Motivated by Dohmen-Pönitz-Tittmann's bivariate chromatic polynomial $χ_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of Stanley's order polynomial, which counts order preserving maps from a given poset to a chain. Our results include decomposition formulas in terms of linear extensions, a combinatorial reciprocity theorem, and connections to bivariate chromatic polynomials.