Abstract
The management decision problems are often formulated as the multiobjective programming problems with 0-1 variables.This paper presents two interactive and heuristic methods for the problems. In these methods, the decision-maker merely selects his preferred (or repugnant) points from a succession of small sets of candidate solutions. Using techniques for constacting and shifting the cinvex cone generated by the gradients of the multiple objectives, each method employs an algorithm for vector-maximum problem to focus on the decision-maker's most satisfying solution. Further, the implicit enumeration technique is used for finding candidate solutions. Some numerical experiments are designed to investigate the properties of methods.
