Search

This paper considers the maximization of certain equivalent reward generated by a Markov decision process with constant risk sensitivity. First, value iteration is used to optimize possibly time-varying processes of finite duration. Then a policy iteration procedure is developed to find the stationary policy with highest certain equivalent gain for the infinite duration case. A simple example demonstrates both procedures. [ABSTRACT FROM AUTHOR]

The topology of the Generalized Transportation Problem, at the end of each iteration of the stepping-stone method, is characterized by a variable number of loops to which are attached multiple branched side chains or trees. An efficient computer representation of this structure and methods for updating it are described in this paper. [ABSTRACT FROM AUTHOR]

The article reports on a production model that can be used by industries to schedule the production process for a given commodity. The author focuses on a model in which the cost per unit is either a fixed or non-decreasing function of the production rate, and there are no costs associated with changing the rate of production. It is suggested that production models that adhere to the aforementioned standards can also be transportation models, and can be solved by utilizing a variant of the iterative simplex method. The resulting model schedules production while minimizing final costs.