Solution techniques for some allocation problems

Journal Article

This paper presents methods for solving allocation problems that can be stated as convex knapsack problems with generalized upper bounds. Such bounds may express upper limits on the total amount allocated to each of several subsets of activities. In addition our model arises as a subproblem in more complex mathematical programs. We therefore emphasize efficient procedures to recover optimality when minor changes in the parameters occur from one problem instance to the next. These considerations lead us to propose novel data structures for such problems. Also, we introduce an approximation method to solve certain equations, which arise during the procedures. © 1983 The Mathematical Programming Society, Inc.

Full Text

Duke Authors

Cited Authors

  • Federgruen, A; Zipkin, P

Published Date

  • 1983

Published In

Volume / Issue

  • 25 / 1

Start / End Page

  • 13 - 24

International Standard Serial Number (ISSN)

  • 0025-5610

Digital Object Identifier (DOI)

  • 10.1007/BF02591716