首页   按字顺浏览 期刊浏览 卷期浏览 Solving 0-1 Minimax Problems
Solving 0-1 Minimax Problems

 

作者: JorgensenC.,   PowellS.,  

 

期刊: Journal of the Operational Research Society  （Taylor Available online 1987）
卷期: Volume 38, issue 6  

页码: 515-522

 

ISSN:0160-5682

 

年代: 1987

 

DOI:10.1057/jors.1987.89

 

出版商: Taylor&Francis

 

关键词: linear programming;optimization

 

数据来源: Taylor

 

摘要:

AbstractIt has been shown that it is possible to solve a minimax 0-1 programming problem by transforming the objective function coefficients and solving a minisum problem. This result is very useful for solving a‘hard’minimax problem when there exists a‘relatively easy’algorithm to solve the minisum problem. We discuss such problems and present a new transformation.

 

点击下载:  PDF (3428KB)



返 回