MAXIMUM NETWORK FLOW INTERDICTION PROBLEM WITH MULTIPLEUSERS

The aim of this paper is to study the maximum networkflow problem. The problem is considered as an interdictionproblem that has two players, Player I, that is usually calleduser, wants to flow his/her commodities and Player II, thatis attacker, wants to interdict the movement user. Thispaper considers the problem in the case that there existseveral users. Modelling and solving of the problem areconsidered. First, the problem is modeled as amulti-objective programming problem and then, by theweighted sum method, it is written as a single-objectiveprogramming problem. By using the duality of the innerproblem and the variable transformation, the model isconverted to the single-level linear programming problem.Finally, a numerical example is represented and is solvedby the proposed approach.