Abstract
In this paper, a linear optimization approach to solve multiple criteria decision making (MCDM) problems is presented. For this purpose, two linear programming problems are proposed in the most favorable and least favorable senses. Then, an overall score as an interval number for each alternative is obtained. The lower bound is the score in the most favorable sense and its upper bound is the performance in the least favorable sense. The order of all alternatives is ranked in descending order in accordance with these interval numbers using the concept of degree of possibility. This study makes three major contributions. First, the proposed method employs linear programming (LP) technique to solve MCDM problems. Second, the common set of weights are utilized to solve the proposed LP models. Finally, the presented approach incorporates the decision maker preferences in decision making process.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
