OIM 301 Lecture Notes - Lecture 9: X21 (Band), Linear Programming
23 Mar 2017
School
Department
Course
Professor
Document Summary
3/21/17: transportation modeling, an interactive procedure that finds the least costly means of moving products from a series of sources to a series of destinations, a special class of linear programming, need to know, 1. The origin points and the capacity or supply per period at each: 2. The destination points and the demand per period at each: 3. The cost of shipping one unit from each origin to each destination: northwest-corner rule, start in the upper left hand cell (or northwest corner) or the table and allocate units to shipping routes as follows, 1. Exhaust the supply (factory capacity) of each row before moving down to the next row: 2. Exhaust the (warehouse) requirements of each column before moving to the next column: 3. Check to ensure that all supplies and demands are met: ex, 1. Assign 100 tubs from des moines to albuquerque: 2. Assign 200 tubs from evansville to albuquerque (exhausting: 3.
