INTERDICTING THE ACTIVITIES OF A LINEAR PROGRAM - A PARAMETRIC ANALYSIS

this paper, we consider two interdiction problems for a linear program . These generalize the problems proposed by Fulkerson and Harding and by Golden for the shortest path problem. These problems also provide e quilibrium analysis for a system in which some kind of resource can be used to change the original equilibrium. We show that these two probl ems can be solved simultaneously by performing parametric analysis of a linear program with bounded variables. We also consider their applic ations for the interdiction of flow networks. In particular, we propos e an algorithm for solving the related parametric network flow problem .