Scribd
Upload
109 views2 pages

Distribution Unlimited Co - Minimum Cost Flow Problem

This document outlines a minimum cost flow problem involving shipments between nodes. It lists the nodes, shipment capacities between nodes, unit costs of shipments, and the total cost of shipments. The optimal shipment amounts that minimize total cost while satisfying all demands are also shown.

Uploaded by

NGUYÊN BÙI NGUYỄN ĐAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
109 views2 pages

Distribution Unlimited Co - Minimum Cost Flow Problem

This document outlines a minimum cost flow problem involving shipments between nodes. It lists the nodes, shipment capacities between nodes, unit costs of shipments, and the total cost of shipments. The optimal shipment amounts that minimize total cost while satisfying all demands are also shown.

Uploaded by

NGUYÊN BÙI NGUYỄN ĐAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Distribution Unlimited Co.

Minimum Cost Flow Problem

From To Ship Capacity Unit Cost Nodes


F1 W1 30 700 F1
F1 DC 50 <= 50 300 F2
DC W1 30 <= 50 200 DC
DC W2 50 <= 50 400 W1
F2 DC 30 <= 50 500 W2
F2 W2 40 1000

Total Cost 117000


Net Flow Supply/Demand
80 = 80
70 = 70
0 = 0
-60 = -60
-90 = -90

You might also like