Linear Programming problem diagram

written by - Comments off

This diagram depicts a system of aqueducts that originate at three rivers (nodes R1, R2 and R3) and terminate at a major city (node T), where the other nodes are junction points in the system: (see pic 1 attachment)

Using units of thousands of acre feet, the following tables show the maximum amount of water that can be pumped through each aqueduct per day:

To
From A B C
R1 75 65
R2 40 50 60
R3 80 70

To
From D E F
A 60 45
B 70 55 45
C 70 90

To
From T
D 120
E 190
F 130

a) Formulate and solve this problem as a maximum flow problem using Solver.

Maximum flow is: _______________________________

Note: Currently, Regular Priority times are 3-5 days. Log in to upload files with your questions. Tutorials you buy shall be emailed to your PAYPAL email. Talking about quality references: finding and referencing an (n+1)th article for your tutorial requires substantially more time than the (n)th article referenced, therefore you will see the price increasing with the number of references you require in some questions. Wanted to contact us over something related to this question? Email us: support AT oxenmine.com.

© 2010 oxenMINE.com: Customized Homework help. - Powered by OM