首页   按字顺浏览 期刊浏览 卷期浏览 A cutting plane algorithm for the bilinear programming problem
A cutting plane algorithm for the bilinear programming problem

 

作者: H. Vaish,   C. M. Shetty,  

 

期刊: Naval Research Logistics Quarterly  （WILEY Available online 1977）
卷期: Volume 24, issue 1  

页码: 83-94

 

ISSN:0028-1441

 

年代: 1977

 

DOI:10.1002/nav.3800240107

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractIn this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts.

 

点击下载:  PDF (731KB)



返 回