A NOTE ON THE SOLUTION OF BILINEAR-PROGRAMMING PROBLEMS BY REDUCTION TO CONCAVE MINIMIZATION

被引：20

作者：

THIEU, TV

机构：

来源：

关键词：

D O I：

10.1007/BF01580766

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：249 / 260

页数：12

共 26 条

[1] JOINTLY CONSTRAINED BICONVEX PROGRAMMING [J].

ALKHAYYAL, FA ;

FALK, JE .

[2]

ALTMAN M, 1968, B ACAD POL SCI SMAP, V16, P741

[3]

BAN VT, 1983, JAN P IFIP WORK C RE

[4] A FINITE ALGORITHM FOR CONCAVE MINIMIZATION OVER A POLYHEDRON [J].

BENSON, HP .

[5]

Falk J. E., 1973, Mathematical Programming, V5, P169, DOI 10.1007/BF01580119

[6]

Frieze A. M., 1974, Mathematical Programming, V7, P376, DOI 10.1007/BF01585532

[7] BILINEAR PROGRAMMING - EXACT ALGORITHM [J].

GALLO, G ;

ULKUCU, A .

[8] CUTTING PLANE ALGORITHM FOR SOLVING BILINEAR PROGRAMS [J].

KONNO, H .

[9]

KONNO H, 1971, 7110 STANF U DEP OR

[10] EQUILIBRIUM POINTS OF BIMATRIX GAMES [J].

MANGASARIAN, OL .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (04) :778-780