Several interactive schemes for solving multicriteria discrete programming problems are developed under a dynamic programming framework. It is assumed that the decision maker's preference structure satisfies the conditions of transitivity, monotonicity, and nonsatiation. Hybrid procedures are also structured by including branch and bound ideas into the recursions. Initial computational results are offered. © 1981.