×

An interactive procedure to solve multi-objective decision-making problem: an improvment to STEM method. (English) Zbl 1244.90213

Summary: 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.

MSC:

90C29 Multi-objective and goal programming

References:

[1] C. L. Hwang and K. Yoon, Multiple Attribute Decision Making, vol. 186 of Methods and Applications, A State-of-the-Art Survey, Springer, Berlin, Germany, 1981. · Zbl 0453.90002
[2] C. L. Hwang and A. S. Masud, Multiple Objective Decision Making-Methods and Applications, vol. 164, Springer, Berlin, Germany, 1979. · Zbl 0397.90001
[3] R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev, “Linear programming with multiple objective functions: step method (stem),” Mathematical Programming, vol. 1, no. 1, pp. 366-375, 1971. · Zbl 0242.90026 · doi:10.1007/BF01584098
[4] J. Lu, G. Zhang, D. Ruan, and F. Wu, Multi-Objective Group Decision Making Methods, Software and Applications with Fuzzy Set Techniques, Imperial College Press, London, UK, 2007. · Zbl 1155.68078
[5] M. Sakawa, Fuzzy Sets and Interactive Multiobjective Optimization, Plenum Press, New York, NY, USA, 1993. · Zbl 0842.90070
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.