REPRESENTABILITY IN MIXED INTEGER PROGRAMMING .1. CHARACTERIZATION RESULTS

被引:44
作者
JEROSLOW, RG
机构
[1] Georgia Inst of Technology, Atlanta,, GA, USA, Georgia Inst of Technology, Atlanta, GA, USA
关键词
The representation techniques used here are most effective when applied to a subset of the entire set of a larger mixed integer program (MIP). In a later paper \[33\] we will describe the extension of these techniques to provide 'linkage' between the * The work reported here has been partially supported by National Science Foundation grant MCS-8304075;
D O I
10.1016/0166-218X(87)90026-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
62
引用
收藏
页码:223 / 243
页数:21
相关论文
共 63 条
[1]  
BALAS E, 1979, DISCRETE OPTIM, V2, P3
[2]  
Balas E., 1975, NONLINEAR PROGRAMMIN, V2, P279
[3]  
BALAS E, 1974, GSIA348 CARN U
[4]  
BAZARAA MS, 1976, F OPTIMIZATION
[5]  
BEALE EML, 1979, DISCRETE OPTIM, V2, P201
[6]   THE VALUE FUNCTION OF AN INTEGER-PROGRAM [J].
BLAIR, CE ;
JEROSLOW, RG .
MATHEMATICAL PROGRAMMING, 1982, 23 (03) :237-273
[7]   CONSTRUCTIVE CHARACTERIZATIONS OF THE VALUE-FUNCTION OF A MIXED-INTEGER PROGRAM .1. [J].
BLAIR, CE ;
JEROSLOW, RG .
DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) :217-233
[8]  
BLAIR CE, 1985, DISCRETE APPL MATH, V10, P227, DOI 10.1016/0166-218X(85)90045-9
[9]   CONVERSE FOR DISJUNCTIVE CONSTRAINTS [J].
BLAIR, CE ;
JEROSLOW, RG .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1978, 25 (02) :195-205
[10]  
Borwein J. M., 1979, Operations Research Verfahren, V31, P99