A linear-time algorithm for solving continuous maximin knapsack problems

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 sp...

Full description

Saved in:
Bibliographic Details
Published inOperations Research Letters Vol. 10; no. 1; pp. 23 - 26
Main Authors Kuno, Takahito, Konno, Hiroshi, Zemel, Eitan
Format Journal Article
LanguageEnglish
Japanese
Published Amsterdam Elsevier B.V 01.02.1991
Elsevier BV
Elsevier
Subjects
Applied sciences
binary search
continuous knapsack problem
Exact sciences and technology
Flows in networks. Combinatorial problems
linear maximin problem
linear-time algorithm
Operational research and scientific management
Operational research. Management science
binary search
linear maximin problem
continuous knapsack problem
linear-time algorithm
Continuous
Maximin problem
Algorithm
Linearity
Combinatory problem
Knapsack problem
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/0167-6377(91)90082-Z

Cover

More Information
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(91)90082-Z