BU275 Lecture Notes - Lecture 2: Network Model, Joule
Document Summary
Transportation, transshipment, and assignment problems: can be formulated as lp & solved by computer. If rhs of lp formulations are all integers, optimal solution will be also be integer (special property!: most s/w contains separate code for these models (to take advantage of their network structure) Formulated in terms of amounts shipped from origins to destinations, xij. Sxij < si for each origin i j. Sxij = dj or each destination j i xij > 0 for all i and j. Sxik < si for each origin i k. Sxik - sxkj = 0 for each intermediate i j node k. Sxkj = dj for each destination j k xik , xkj > 0 for all i and j. Farm fresh is a farming operation that has two fields: field 1 and field 2. The company ships the potatoes it wants to sell to be stored in two warehouses warehouse a and.
