NON-LINEAR INTEGER PROGRAMMING - SENSITIVITY ANALYSIS FOR BRANCH AND BOUND

被引:15
作者
SKORINKAPOV, J
GRANOT, F
机构
[1] Univ of British Columbia, Vancouver,, BC, Can, Univ of British Columbia, Vancouver, BC, Can
关键词
* This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5.83998;
D O I
10.1016/0167-6377(87)90041-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
11
引用
收藏
页码:269 / 274
页数:6
相关论文
共 11 条
[2]   A DUALITY THEOREM FOR CONVEX PROGRAMS [J].
DORN, WS .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (04) :407-414
[3]  
Dorn WS, 1960, Q APPL MATH, V18, P155, DOI [10.1090/qam/112751, DOI 10.1090/QAM/112751]
[4]  
HAMMER PL, 1970, REV FR INFORM RECH O, V4, P67
[5]  
LAUGHHUNN DJ, 1970, OPER RES, V10, P454
[7]   FINDING ALL SOLUTIONS FOR A CLASS OF PARAMETRIC QUADRATIC INTEGER PROGRAMMING-PROBLEMS [J].
MCBRIDE, RD ;
YORMARK, JS .
MANAGEMENT SCIENCE, 1980, 26 (08) :784-795
[8]  
MODER JJ, 1964, REINHOLD IND ENG MAN
[9]  
RADKE MA, 1975, THESIS U CALIFORNIA
[10]   SENSITIVITY ANALYSIS FOR BRANCH AND BOUND INTEGER PROGRAMMING [J].
SCHRAGE, L ;
WOLSEY, L .
OPERATIONS RESEARCH, 1985, 33 (05) :1008-1023