SOME RESULTS CONCERNING POST-INFEASIBILITY ANALYSIS

被引:51
作者
CHAKRAVARTI, N
机构
[1] Indian Inst of Management, Calcutta, India
关键词
Constraint theory;
D O I
10.1016/0377-2217(94)90152-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Linear constraints are used to model diverse phenomena. The number of constraints is large in many practical applications, often running into several thousands. A system of linear constraints is quite often inconsistent especially at the stage of model formulation. A number of different approaches are possible when a system of linear constraints turns out to be inconsistent. We prove some results on some plausible approaches and their limitations.
引用
收藏
页码:139 / 143
页数:5
相关论文
共 9 条
[1]  
BROWN G, 1977, NOV ORSA TIMS C
[2]   Locating minimal infeasible constraint sets in linear programs [J].
Chinneck, John W. ;
Dravnieks, Erik W. .
ORSA journal on computing, 1991, 3 (02) :157-168
[3]  
Garey MR., 1979, COMPUTERS INTRACTABI
[4]  
Greenberg H. J., 1991, ORSA Journal on Computing, V3, P253, DOI 10.1287/ijoc.3.3.253
[5]  
GREENBERG HJ, 1987, MATH PROGRAM STUD, V31, P79, DOI 10.1007/BFb0121180
[6]  
Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI
[7]  
ROODMAN GM, 1979, MANAGE SCI, V23, P917
[8]  
RYAN J, 1990, MAY ORSA TIMS C
[9]   IRREDUCIBLY INCONSISTENT SYSTEMS OF LINEAR INEQUALITIES [J].
VANLOON, JNM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 8 (03) :283-288