CUTTING PLANE ALGORITHM FOR SOLVING BILINEAR PROGRAMS

被引:173
作者
KONNO, H [1 ]
机构
[1] UNIV TSUKUBA,IBARAKI,JAPAN
关键词
D O I
10.1007/BF01580367
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:14 / 27
页数:14
相关论文
共 20 条
[1]  
ALTMAN M, 1968, B ACAD POL SCI SMAP, V16, P741
[2]  
BALAS E, 1973, GSIA299 CARN MELL U
[3]   SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING EXTREME POINTS [J].
CABOT, AV ;
FRANCIS, RL .
OPERATIONS RESEARCH, 1970, 18 (01) :82-&
[4]   THE MAXIMIZATION OF A QUADRATIC FUNCTION OF VARIABLES SUBJECT TO LINEAR INEQUALITIES [J].
CANDLER, W ;
TOWNSLEY, RJ .
MANAGEMENT SCIENCE, 1964, 10 (03) :515-523
[5]   NONLINEAR POWER OF ADJACENT EXTREME POINT METHODS IN LINEAR-PROGRAMMING [J].
CHARNES, A ;
COOPER, WW .
ECONOMETRICA, 1957, 25 (01) :132-153
[6]  
COTTLE R, 1970, INTEGER NONLINEAR PR
[7]  
DANTZIG GB, 1958, P1459 RAND REP
[8]  
DANTZIG GB, UNPUBLISHED NOTE
[9]  
Falk J. E., 1973, Mathematical Programming, V5, P169, DOI 10.1007/BF01580119
[10]  
GALLO G, 1973, 8TH INT S MATH PROGR