MSCI 2200 Chapter Notes - Chapter 6: Joule
Document Summary
Can be represented by a set of nodes, arcs and functions associated with the arcs and/or nodes. Transportation, assignment, and transshipment problems are all examples of network problems. Can be formulated as lp and solved by computer. If rhs of lp formulations are all integers, os will also be an integer. Seeks to minimize total shipping costs of transporting goods from m origins (each with supply si) to n destinations (each with demand dj), when the unit shipping cost from an origin, i, to a destination, j is cij. Lp formulation: formulated in terms of amounts shipped from origins to destinations, xij, minimize cijxij i j, constraints: Xij si for each origin i. Xij = dj for each destination j. Xij 0 for all i and j. Special cases modification to lp formulation: minimum shipping guarantees from i to j. Xij lij (l = limit: maximum route capacity from i to j.