Publication
J. Math. Anal. Appl.
Paper

Some comments on preference order dynamic programming models

View publication

Abstract

A simple deterministic dynamic programming model is used as a general framework for the analysis of stochastic versions of three classical optimization problems: knapsack, traveling salesperson, and assembly line balancing problems. It is shown that this model can provide an alternative to the preference order models proposed for these problems. Counterexample to the optimality of the preference order models are presented. © 1981.

Date

Publication

J. Math. Anal. Appl.

Authors

Topics

Share