Optimal sequential file search: a reduced-state dynamic programming approach

Article Abstract:

Dynamic programming is employed to solve a file search problem modeled as a finite-state and finite-action Markov decision process. The problem involves the determination of 'whether or not a record is in a sequential file whose contents are initially unknown' such that the cost of acquiring information about 'positions within the file' is minimized as much as possible. The result is a polynomial time algorithm for deriving the state transition probabilities and expected payoffs.

Search theory

---

Joint replacement in an operational planning phase

Article Abstract:

A heuristic rolling horizon technique is proposed for the solution of a multicomponent replacement problem in an operational planning phase. A combination technique and a dynamic programming algorithm introduced by Wildeman, Dekker and Smit (1995) are used. In such an approach, computations for determining an action at certain decision epochs is only quadratic in the number of components.

Decision-making, Decision making, Production control

---

Cash management in a randomly varying environment

Article Abstract:

Research is presented describing the study of statistical and economic environment changes on the management of cash systems using Markov decision processing.

Cash management

Similar abstracts:

• Abstracts: Solving the multiobjective possibilistic linear programming problem. Leximim optimality and fuzzy set-theoretic operations
• Abstracts: Oil industry looks further afield. Environment enervates Eastern Europe and emerging economies
• Abstracts: Location and sizing of offshore platforms for oil exploration. Generation of efficient frontiers in multi-objective optimization problems by generalized data envelopment analysis

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.