A LINEAR-TIME ALGORITHM FOR SOLVING CONTINUOUS MAXIMIN KNAPSACK-PROBLEMS

被引：19
|
作者：
KUNO, T
KONNO, H
ZEMEL, E
机构：
[1] TOKYO INST TECHNOL,INST HUMAN & SOCIAL SCI,TOKYO 152,JAPAN
[2] NORTHWESTERN UNIV,JL KELLOGG GRAD SCH MANAGEMENT,EVANSTON,IL 60208
来源：
OPERATIONS RESEARCH LETTERS | 1991年 / 10卷 / 01期
关键词：
LINEAR MAXIMIN PROBLEM; CONTINUOUS KNAPSACK PROBLEM; LINEAR-TIME ALGORITHM; BINARY SEARCH;
D O I：
10.1016/0167-6377(91)90082-Z
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper introduces a special class of mathematical programming problem which maximizes the minimal value of a set of linear functions subject to a single linear constraint and upper bounding constraint on each variable. An O(n) algorithm for solving this problem is described by exploiting its special structure.
引用
收藏
页码：23 / 26
页数：4
相关论文
共 50 条
12345