An interactive procedure to solve multi-objective decision-making problem: An improvment to STEM method

Decisions in the real-world contexts are often made in the presence of multiple,conflicting,and incommensurate criteria. multiobjective programming methods such as multiple objective linear programming (molp) are techniques used to solve such multiple-criteria decision-making (mcdm) problems. one of the first interactive procedures to solve molp is stem method. in this paper we try to improve stem method in a way that we search a point in reduced feasible region whose criterion vector is closest to positive ideal criterion vector and furthest to negative ideal criterion vector. therefore the presented method tries to increase the rate of satisfactoriness of the obtained solution. finally,a numerical example for illustration of the new method is given to clarify the main results developed in this paper. © copyright 2012 r. roostaee et al.