BILINEAR PROGRAMMING PROBLEM

被引：37
作者：
VAISH, H
SHETTY, CM
机构：
[1] CALIF STATE UNIV NORTHRIDGE, NORTHRIDGE, CA USA
[2] GEORGIA INST TECHNOL, ATLANTA, GA 30332 USA
来源：
NAVAL RESEARCH LOGISTICS | 1976年 / 23卷 / 02期
关键词：
D O I：
10.1002/nav.3800230212
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：303 / 309
页数：7
相关论文
共 13 条
[1]  
[Anonymous], 1967, Convex polytopes
[2]   INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].
BALAS, E .
OPERATIONS RESEARCH, 1971, 19 (01) :19-+
[3]  
COOPER L, 1973, OPER RES, V11, P331
[4]  
GALLO G, 1973, ORC7326 U CAL OP RES
[5]  
Konno H., 1971, BILINEAR PROGRAMMING
[6]  
KONNO H, 1971, 7110 STANF U OP RES
[7]  
Lasdon LS., 1970, Optimization Theory for Large Systems
[8]   GENERATION OF ADMISSIBLE BOUNDARY OF A CONVEX POLYTOPE [J].
SHACHTMAN, R .
OPERATIONS RESEARCH, 1974, 22 (01) :151-159
[9]  
SHACHTMAN R, 1974, COMMUNICATION MAY
[10]  
TUI H, 1964, SOV MATH DOKL, V5, P1437
12