抄録
The aim of this paper is to provide a mathematical model for interactive decision making problems under multiple objectives, where the information about the decision maker's preferences is expressed in the form of aspiration levels. It is shown that the proposed mathematical model can be used not only for satisficing decision making but also for Pareto optimization ; this model is equally applicable to Single Criterion Decision Making (SCDM) problems. For the optimization of the mathematical model, Box's Complex Search (a derivative free method) with some simple modifications is proposed. Finally, a metal cutting problem is formulated and solved.
