Interdicting the activities of a linear program — A parametric analysis

In 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 equilibrium analysis for a system in which some kind of resource can be used to change t...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1995-11, Vol.86 (3), p.580-591
Main Authors: Chern, Maw-Sheng, Lin, Kao-Chêng
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Exact sciences and technology
Flow control
Flow networks
Flows in networks. Combinatorial problems
Interdiction problems
Linear programming
Mathematical models
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations research
Parametric analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In 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 equilibrium analysis for a system in which some kind of resource can be used to change the original equilibrium. We show that these two problems can be solved simultaneously by performing parametric analysis of a linear program with bounded variables. We also consider their applications for the interdiction of flow networks. In particular, we propose an algorithm for solving the related parametric network flow problem.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(94)00057-J