We formally discuss the sensitivity of a ranking induced by an additiv
e value function. Additive value functions are determined by linear pr
ograms which extrapolate few explicit ranking relations to a realistic
ally large set of alternatives. Sensitivity of rankings is accomplishe
d by mixed integer programming and by nesting suitable linear programs
rather than by sensitivity considerations of linear programming. Copy
right (C) 1996 Elsevier Science Ltd