The Dual Decomposition Method and Its Application to an Interdicted Network

Abstract

This paper introduces the dual decomposition method for determining the distribution of an optimal objective function for a network problem. The objective function is to minimize the shortfall of demands to prioritized sinks for a four day period over a network that is subject to interdiction. The requirements of the model are that the upper and lower bounds on the capabilities of the arcs and nodes of the network and the probabilities of interdiction are known. The dual decomposition method is an iterative approach to enumerating the possible instances of capacities in a capacitated network, based on the dual variables of the previous iteration. The purpose of the procedure is to determine the distribution of the shortfall of demands so that logistics planners can predict the performance of a supply distribution system over a short period of time. Keywords: Network; Interdiction; Transportation; Dual decomposition; Theses.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1989
Accession Number
ADA207884

Entities

People

  • Timothy P. Gannon

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms
  • C4I
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computer Programming
  • Computer Programs
  • Computers
  • Flow Network
  • Interdiction
  • Land Transportation
  • Linear Programming
  • Literature Surveys
  • Logistics
  • Operations Research
  • Probability
  • Probability Distributions
  • Supply Depots
  • Transportation
  • United States

Readers

  • Maritime Combat Support and Expeditionary Logistics.
  • Operations Research