Solution of Singly-Constrained Concave Allocation Problems,

Abstract

The optimization technique of mathematical programming is used to treat a class of problems to determine a resource allocation to a set of independent alternatives. Maximization of the return is the desired result. The allocation problem is treated first as an integer problem, then as a continuous one. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1970
Accession Number
ADA067021

Entities

People

  • James T. Mcgill

Organizations

  • Institute for Defense Analyses

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Computer Programming
  • Convex Programming
  • Convex Sets
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Probability
  • Real Numbers
  • Systems Analysis
  • Targeting
  • Targets
  • Theorems
  • Two Dimensional

Fields of Study

  • Mathematics

Readers

  • Operations Research