Focusing on the testable implications on the equilibrium manifold, we show that the rationalizability problem is NP-complete. Subsequently, we present an integer programming (IP) approach to characterizing general equilibrium models. This approach avoids the use of the Tarski-Seidenberg...