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.