Social interactions make communicable disease a core concern of public health policy. A prevalent problem is scarcity of empirical evidence that are informative about how interventions affect population behavior and illness. Randomized trials, which have been important to evaluation of...

We describe and compare several algorithms for approximating the solution to a model in" which inequality constraints occasionally bind. Their performance is evaluated and compared" using various parameterizations of the one sector growth model with irreversible investment. We" develop...

Rules often are complex in order to distinguish different types of behavior that may have different consequences. Greater complexity thus allows better control of behavior. But individuals may need to incur costs ex ante to determine how more complex rules apply to their contemplated conduct....

This paper formulates a model of retirement behavior based on the solution to a stochastic dynamic programming problem. The workers objective is to maximize expected discounted utility over his remaining lifetime. At each time period the worker chooses how much to consume and whether to work...

We study the optimal pattern of outlays for a single firm pursuing an R&D program over time. In the deterministic case, (a) the amount of progress required to complete the project is known, and (b) the relationship between outlays and progress is known. In this case, it is optimal to increase...

A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are...

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

Lemke's dual-simplex method of linear programming is usually considered inferior to the primal simplex method for any general linear programming problems. One reason given is the difficulty of finding a starting dual-feasible basis. In this paper, a new starting technique is presented, which...