| Article ID: | iaor19971879 |
| Country: | United Kingdom |
| Volume: | 23 |
| Issue: | 12 |
| Start Page Number: | 1119 |
| End Page Number: | 1130 |
| Publication Date: | Dec 1996 |
| Journal: | Computers and Operations Research |
| Authors: | Kmpke Thomas |
The paper formally discusses the sensitivity of a ranking induced by an additive value function. Additive value functions are determined by linear programs which extrapolate few explicit ranking relations to a realistically large set of alternatives. Sensitivity of rankings is accomplished by mixed integer programming and by nesting suitable linear programs rather than by sensitivity considerations of linear programming.