A mathematical model is developed for countercapacity interdiction problems involving the allocation of a limited amount of resources, such as air strikes, among the arcs of a supply network so as to minimize the network flow capacity. For source-sink planar networks, it is possible to construct and solve a closely related dual problem, and then to interpret the dual solution in terms of the original network. A computer program implementing a restricted special case of the solution is included, with examples of its use in solving countercapacity interdiction problems. Extensions of the method to other than source-sink planar networks are discussed. (See also RM-5864, RM-6065.)
This report is part of the RAND Corporation Report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research.
Our mission to help improve policy and decisionmaking through research and analysis is enabled through our core values of quality and objectivity and our unwavering commitment to the highest level of integrity and ethical behavior. To help ensure our research and analysis are rigorous, objective, and nonpartisan, we subject our research publications to a robust and exacting quality-assurance process; avoid both the appearance and reality of financial and other conflicts of interest through staff training, project screening, and a policy of mandatory disclosure; and pursue transparency in our research engagements through our commitment to the open publication of our research findings and recommendations, disclosure of the source of funding of published research, and policies to ensure intellectual independence. For more information, visit www.rand.org/about/principles.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.