Sensitivity analysis for assessing preferentially independent order relations

被引：5

作者：

Kampke, T

机构：

[1] Forsch. Inst. A., 89081 Ulm

来源：

COMPUTERS & OPERATIONS RESEARCH | 1996年 / 23卷 / 12期

关键词：

D O I：

10.1016/S0305-0548(96)00038-X

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We formally discuss 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. Copyright (C) 1996 Elsevier Science Ltd

引用

页码：1119 / 1130

页数：12

共 19 条

[1]

[Anonymous], 1975, LINEAR PROGRAMMING M

[2] Locating minimal infeasible constraint sets in linear programs [J].