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...

In this paper we propose a Branch and Price algorithm for solving multi-period single-sourcing problems. In particular, we generalize a Branch and Price algorithm that was developed for the Generalized Assignment Problem (GAP) to a class of convex assignment problems. We then identify an...

Erratum to Mairs, Thomas G., Glenn W. Wakefield, Ellis L. Johnson, Kurt Spielberg. 1978. On a production allocation and distribution problem. Management Sci. 24 (November).

This paper proposes using nonlinear mixed-integer programming to solve the customized bundle-pricing problem in which consumers are allowed to choose up to N goods out of a larger pool of J goods. Prior work has suggested that this mechanism has attractive features for the pricing of information...

In this paper¹, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form \sum _{(i,j)\epsilonQ}F\bar _ij(w_ij) + \sum _i\epsilonPB\bar _i(\mu _i)), the constraints are similar to those arising in the dual of a minimum...

Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels or grades, the Multi-level Network Design (MLND) problem seeks a fixed cost minimizing design that spans all the nodes and connects the nodes at each level by facilities of the...