DISCRETE OPTIMIZATION VIA MARGINAL ANALYSIS

Abstract

Discrete optimization subject to one constraint is attacked by Lagrangian analysis. Incremental allocation schemes are given that generate undominated allocations. In an important special case, the complete family of undominated allocations is generated.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1966
Accession Number
AD0626604

Entities

People

  • Bennett Fox

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • California
  • Computer Programming
  • Corporations
  • Dynamic Programming
  • Inequalities
  • Integrals
  • Iterations
  • Mathematics
  • Optimization
  • Probability
  • Redundancy
  • Sensitivity
  • Survival

Readers

  • Computational Fluid Dynamics (CFD)
  • Medical or Health Care Field.
  • Systems Analysis and Design