Integer Prim-Read Solutions to a Class of Target Defense Problems

Abstract

The problem we address is that of choosing a deployment and firing doctrine for defending separated point targets of (potentially) different values against an attack by an unknown member of sequentially arriving missiles. We minimize the total number of defenders subject to an upper bound on the maximum expected value damage per attacking weapon. We show that the Greedy Algorithm produces an optimal integral solution to this problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1983
Accession Number
ADA134191

Entities

People

  • Alan F. Karr
  • James E. Falk
  • Stefan A. Burr

Organizations

  • Institute for Defense Analyses

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Anti-Ballistic Missiles
  • Ballistic Missiles
  • California
  • Civil Defense
  • Classification
  • Classified Materials
  • Computations
  • Deployment
  • Doctrine
  • Integrals
  • Notation
  • Security
  • Stockpiles
  • United States
  • Weapons

Fields of Study

  • Computer science

Readers

  • Marksmanship and Weaponry.
  • Operations Research
  • Rehabilitation and Prosthetic Care for Military Service Members and Veterans with Limb Loss or Disability.