Skip to main content
Journal cover image

Solution techniques for some allocation problems

Publication ,  Journal Article
Federgruen, A; Zipkin, P
Published in: Mathematical Programming
1983

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.

Duke Scholars

Published In

Mathematical Programming

DOI

ISSN

0025-5610

Publication Date

1983

Volume

25

Issue

1

Start / End Page

13 / 24

Related Subject Headings

  • Operations Research
  • 0802 Computation Theory and Mathematics
  • 0103 Numerical and Computational Mathematics
  • 0102 Applied Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Federgruen, A., & Zipkin, P. (1983). Solution techniques for some allocation problems. Mathematical Programming, 25(1), 13–24. https://doi.org/10.1007/BF02591716
Federgruen, A., and P. Zipkin. “Solution techniques for some allocation problems.” Mathematical Programming 25, no. 1 (1983): 13–24. https://doi.org/10.1007/BF02591716.
Federgruen A, Zipkin P. Solution techniques for some allocation problems. Mathematical Programming. 1983;25(1):13–24.
Federgruen, A., and P. Zipkin. “Solution techniques for some allocation problems.” Mathematical Programming, vol. 25, no. 1, 1983, pp. 13–24. Scival, doi:10.1007/BF02591716.
Federgruen A, Zipkin P. Solution techniques for some allocation problems. Mathematical Programming. 1983;25(1):13–24.
Journal cover image

Published In

Mathematical Programming

DOI

ISSN

0025-5610

Publication Date

1983

Volume

25

Issue

1

Start / End Page

13 / 24

Related Subject Headings

  • Operations Research
  • 0802 Computation Theory and Mathematics
  • 0103 Numerical and Computational Mathematics
  • 0102 Applied Mathematics