The Knapsack Sharing Problem

J. Randall Brown
Additional contact information
J. Randall Brown: Kent State University, Kent, Ohio

Operations Research, 1979, vol. 27, issue 2, 341-355

Abstract: The knapsack sharing problem has a utility or tradeoff function for each variable and seeks to maximize the value of the smallest tradeoff function (a maximin objective function). A single constraint places an upper bound on the sum of the non-negative variables. We develop efficient algorithms for piecewise linear, nonlinear, and piecewise nonlinear tradeoff functions and for any knapsack sharing problem with integer variables. These algorithms for the knapsack sharing problem extend the sharing problem algorithm in a companion paper to any piecewise linear, nonlinear, or piecewise nonlinear tradeoff functions.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.2.341 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:2:p:341-355

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().