Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables.

Abstract

Disaggregation and resource allocation problems can be often formulated as convex knapsack problems with bounded variables. In this paper, we provide a recursive procedure to solve such problems. The method differs from classical optimization algorithms of convex programming in that it determines at each iteration the optimal value of at least one variable. Applications and computational results are presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1980
Accession Number
ADA085190

Entities

People

  • Arnoldo Hax
  • Gabriel R. Bitran

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Programming
  • Dynamic Programming
  • Evolutionary Algorithms
  • Inequalities
  • Inventory Control
  • Iterations
  • Mathematical Programming
  • Military Research
  • Operations Research
  • Optimization
  • Production
  • Production Planning
  • Theorems
  • United States
  • United States Government

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Regression Analysis.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.