Learn how to a build a cloud-first strategyRegister Now

x
• Status: Solved
• Priority: Medium
• Security: Public
• Views: 272

# How to represent Network Flows using Linear Programming (GLPK)

Hi,

The original question (500 points) was put under programming, but someone mentioned experts in this forum could also help:

http://www.experts-exchange.com/Programming/Q_21421081.html
0
SciGuy
• 2
1 Solution

Commented:
Network flow problems can  be solved as linear programming problems by makng the unkowns the flow  along an arc(pipe). The constraints are that the flow allong and arc should not exceed the capicity of the arc and the that the sum of the flow in each node should be 0, (ie flow in =flow out) there is no non negativity constraint on the flows.. The function to maximise is the flow from the source node.

There are better ways of solving these problems than using linear programming (googling should cough up the standard algorithm which is just continually sending flow along paths with free capacity)
0

Commented:
thanks for the points :-)
0

## Featured Post

• 2
Tackle projects and never again get stuck behind a technical roadblock.