Article ID: | iaor20013488 |
Country: | United Kingdom |
Volume: | 28 |
Issue: | 5 |
Start Page Number: | 397 |
End Page Number: | 409 |
Publication Date: | Apr 2001 |
Journal: | Computers and Operations Research |
Authors: | Kim Soung Hie, Park Kyung Sam, Eum Yun Seong |
Keywords: | programming: nonlinear |
The model presented in this paper does not require exact estimations of decision parameters such as attribute weights and values that may often be considerable cognitive burden of human decision makers. Information on the decision parameters is only assumed to be in the form of arbitrary linear inequalities which form constraints in the model. We consider two criteria, dominance and potential optimality, to check whether or not each alternative is outperformed for a fixed feasible region denoted by the constraints. In particular, we develop a method to identify potential optimality of alternatives when all (or subsets) of the attribute values as well as weights are imprecisely known. This formulation becomes a nonlinear programming problem hard to be solved generally so that we provide in this paper how this problem is transformed into a linear programming equivalent.