BUS 31.4 Chapter 10 - Copy

BUS 31.4 Chapter 10 - Copy - Chapter 10 LP Transportation...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 10 – LP Transportation and Assignment Models S. Neuburger Linear Programming – Transportation and Assignment Models Transportation problem deals with distribution of goods from several points of supply to a number of points of demand. Objective: to schedule shipments from sources to destinations attaining minimal transportation and production costs. This model is also used to determine where to place a new facility. In a transportation table, sources are listed in separate rows and destinations in separate columns. Set up initial feasible solution using Northwest corner method : 1. Begin with northwest (upper left-hand) corner of table. 2. Deplete supply at each row before moving down to next row. 3. Fill the requirements of each column before moving right to the next row. 4. Check that supply / demand is met at each source / destination. Test optimality of solution by computing improvement index for each empty cell using stepping stone method : 1. Trace a closed path turning only in squares that are being used, moving only horizontally and vertically. 2.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/01/2010 for the course BUS 5865 taught by Professor Smith during the Spring '10 term at CUNY Baruch.

Page1 / 2

BUS 31.4 Chapter 10 - Copy - Chapter 10 LP Transportation...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online