| (a) The values S, R, and Q and the preference ranking order in the case of “for the most” | | | | |
| x1 | [0.435, 0.859] | [0.128, 0.210] | [0.451−0.036, 1−0.023] | x2 | [0.274, 0.763] | [0.131, 0.190] | [0.471−0.270, 0.867−0.017] | x3 | [0.122, 0.536] | [0.060, 0.120] | [0, 0.399 + 0.150] | x4 | [0.227, 0.754] | [0.098, 0.201] | [0.254−0.116, 0.937−0.099] | x5 | [0.408, 0.876] | [0.123, 0.183] | [0.421−0.042, 0.819 + 0.181] |
| Ranking order | | | Compromise solution set {x3}, {x3, x4}, |
| (b) The values S, R, and Q and the preference ranking order in the case of “at least half” | | | | |
| x1 | [0.440, 0.829] | [0.123, 0.210] | [0.504−0.045, 1−0.049] | x2 | [0.254, 0.804] | [0.136, 0.190] | [0.578−0.354, 0.887 + 0.032] | x3 | [0.077, 0.521] | [0.034, 0.120] | [0, 0.489 + 0.072] | x4 | [0.198, 0.746] | [0.083, 0.190] | [0.279−0.125, 0.889−0.044] | x5 | [0.376, 0.868] | [0.110, 0.180] | [0.431−0.053, 0.830 + 0.170] |
| Ranking order | | | Compromise solution set {x3}, {x3, x4}, |
| (c) The values S, R, and Q and the preference ranking order in the case of “as much as possible” | | | | |
| x1 | [0.410, 0.865] | [0.123, 0.210] | [0.410−0.024, 1−0.010] | x2 | [0.268, 0.740] | [0.120, 0.189] | [0.387−0.190, 0.857−0.033] | x3 | [0.120, 0.533] | [0.063, 0.120] | [0, 0.389 + 0.161] | x4 | [0.207, 0.745] | [0.104, 0.208] | [0.279−0.163, 0.987−0.156] | x5 | [0.399, 0.873] | [0.117, 0.185] | [0.366−0.005, 0.830 + 0.170] |
| Ranking order | | | Compromise solution set {x3}, {x3, x4}, |
|
|