This article develops a dynamic optimization model to describe the supply of a depletable resource within an economy. An implementable version of the model is applied to the dynamic allocation of coal supply to the U.S. energy sector for the period 1979-2000. Several primary energy sources,...

The usefulness of group theoretic methods in solving integer programming (IP) problems is extended by procedures for controlling the size of the groups. The main procedure given shows how an optimal linear programming basis can be altered to reduce the magnitude of its determinant thereby...

Production and capacity expansion decisions are difficult to analyze when there is learning. Later production is less costly, and maybe more profitable, but the company must endure high initial production costs. Mixed integer programming models are presented for optimizing coordinated production...

Group theory is used to integrate a wide variety of integer programming methods into a common computational process. Included are group optimization algorithms, Lagrangian methods, the cutting plane method, and the method of surrogate constraints. These methods are controlled by a supervisor...

Title from cover. "April, 1998"--Cover. -- "December, 1997"--Pref.

Title from cover. "April, 1998"--Cover -- "March, 1998"--Pref.

This paper establishes some asymptotic properties of the finite state and action space Markovian decision model. For the discounted case, a turnpike theorem is proven which states that an optimal immediate decision when the planning horizon is sufficiently large is to choose one of the decisions...

Lagrangean techniques have had wide application to the optimization of discrete optimization problems. Inverse optimization refers to the fact that each time a Lagrangean calculation is made for a specific problem with a given resources vector, an optimal solution is obtained for a related...