Problem 2 [1 pt] Suppose we have a flow network with source and terminating nodes, and link capacities cuv) for each lin
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Problem 2 [1 pt] Suppose we have a flow network with source and terminating nodes, and link capacities cuv) for each lin
Problem 2 [1 pt] Suppose we have a flow network with source and terminating nodes, and link capacities cuv) for each link (u.v). There is also a flow f, where flu.v) is the flow value for link (u,v). The flow f satisfies the capacity and flow conservation constraints, i.e., the flow is feasible. Suppose there is a pair of nodes {x,x} such that there are links (x,x) and (x,x) such that f(x,x) > 0 and f(x,x) > 0. . There is another flow f' that satisfies the link capacity and flow conservation constraints such that f'(xxx) = 0 or f'(x,x) = 0, or both f(u) = f(u) for all the other links (uv) The size of the flow (i.e., the amount of flow from the source node) is the same for fand f. C Give expressions for f'(x,x) and f'(x,x), which are functions of some or all of the following: f(x,x), f(x,x), c(x,x), and c(x,x).
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!