CUTTING PLANE ALGORITHM FOR BILINEAR PROGRAMMING PROBLEM

被引：38

作者：

VAISH, H

SHETTY, CM

机构：

[1] CALIF STATE UNIV NORTHRIDGE, NORTHRIDGE, CA 91324 USA

[2] GEORGIA INST TECHNOL, ATLANTA, GA 30332 USA

来源：

NAVAL RESEARCH LOGISTICS | 1977年 / 24卷 / 01期

关键词：

D O I：

10.1002/nav.3800240107

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：83 / 94

页数：12

共 50 条

[31] BILINEAR PROGRAMMING - EXACT ALGORITHM
GALLO, G
ULKUCU, A
MATHEMATICAL PROGRAMMING, 1977, 12 (02) : 173 - 194
[32] Cutting plane algorithms for the inverse mixed integer linear programming problem
Wang, Lizhi
OPERATIONS RESEARCH LETTERS, 2009, 37 (02) : 114 - 116
[33] Multiobjective integer nonlinear fractional programming problem: A cutting plane approach
Sharma, Vikas
OPSEARCH, 2012, 49 (02) : 133 - 153
[34] Multiobjective integer nonlinear fractional programming problem: A cutting plane approach
Vikas Sharma
OPSEARCH, 2012, 49 (2) : 133 - 153
[35] A CUTTING PLANE ALGORITHM FOR CONVEX-PROGRAMMING THAT USES ANALYTIC CENTERS
ATKINSON, DS
VAIDYA, PM
MATHEMATICAL PROGRAMMING, 1995, 69 (01) : 1 - 43
[36] A long-step, cutting plane algorithm for linear and convex programming
Mitchell, JE
Ramaswamy, S
ANNALS OF OPERATIONS RESEARCH, 2000, 99 (1-4) : 95 - 122
[37] PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING-PROBLEMS
ISHII, H
IBARAKI, T
MINE, H
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1976, 19 (03) : 228 - 244
[38] A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming
John E. Mitchell
Srinivasan Ramaswamy
Annals of Operations Research, 2000, 99 : 95 - 122
[39] AN EFFICIENT CUTTING PLANE ALGORITHM FOR THE SMALLEST ENCLOSING CIRCLE PROBLEM
Jiang, Yi
Luo, Chuan
Ling, Shenggui
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2017, 13 (01) : 147 - 153
[40] A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Stefan Gollowitzer
Bernard Gendron
Ivana Ljubić
Computational Optimization and Applications, 2013, 55 : 647 - 674

← 1 2 3 4 5 →