A study on the feasibility of the inverse supply and demand problem

Authors:
Adrian Deaconu;Eleonor Ciurea
Affiliations:
Transilvania Univ. of Braşov, Theoretical Computer Science Dept., Braşov, Romania;Transilvania Univ. of Braşov, Theoretical Computer Science Dept., Braşov, Romania
Venue:
Proceedings of the 15th WSEAS international conference on Computers
Year:
2011

Citing 3
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Solving Inverse Spanning Tree Problems Through Network Flow Techniques

Operations Research
A study on the feasibility of the inverse maximum flow problems and flow modification techniques in the case of non-feasibility

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we deal with the inverse feasibility problem of the supply and demand problem. In the supply and demand problem there are m source (supply) nodes and n sink (demand) nodes. A flow must be defined from source nodes to demand nodes so that the quantity produced by the source nodes equals the quantity received by the sink nodes. It is possible that this equality can not be possible due to the fact that the network can not support such a flow from the source nodes to the sink nodes. The inverse feasibility supply and demand problem consists in modifing as little as possible the capacities of the network so that the supply and demand problem become feasible in the modified network.