The Boxstep method is used to maximize Lagrangean functions in the context of a branch-and-bound algorithm for the general discrete optimization problem. Results are presented for three applications: facility location, multi-item production scheduling, and single machine scheduling. The...

A family of integer programs is considered whose right-hand-sides lie on a given line segment L. This family is called a parametric integer program (PIP). Solving a (PIP) means finding an optimal solution for every program in the family. It is shown how a simple generalization of the...

The Boxstep method is used to maximize Lagrangean functions in the context of a branch-and-bound algorithm for the general discrete optimization problem. Results are presented for three applications: facility location, multi-item production scheduling, and single machine scheduling. The...

Raiffa (1961) criticizes ambiguity-averse preferences by claiming that hedging is possible with randomization of choices. We argue that the timing of randomization is crucial for hedging. Ex-ante randomizations, which are randomizations before a state is realized, could provide only ex-ante...

By identifying types whose low-order beliefs, up to level l(sub i), about the state of nature coincide, we obtain quotient type spaces that are typically smaller than the original ones, preserve basic topological properties, and allow standard equilibrium analysis even under bounded reasoning....

In Bayesian environments with private information, as described by the types of Harsanyi, how can types of agents be (statistically) disassociated from each other and how are such disassociations reflected in the agents’ knowledge structure? Conditions studied are (i) subjective independence...