The convex polyhedron of all real-valued monotone functions defined on a finite poset is an unbounded variant of the order polytope described by Stanley. If the undirected covering graph of the poset is acyclic, then the lattice of non-empty faces of this polyhedron is a Boolean lattice. In every other case, both semimodularity and dual semimodularity fail.