PS6_solutions - 1. A. For each warehouse i, add a warehouse...

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

View Full Document Right Arrow Icon
A. For each warehouse i, add a warehouse i’ that corresponds to the amount shipped with the surcharge. Let x ij be the amount shipped along route (i,j) at the original cost, and x ij Objective function ’ be the amount shipped along(i’,j) with the surcharge. Supply constraints: Demand constraint: Non-negativity: Because in this example, it is cheaper to ship from the i warehouse before the corresponding i’ warehouse, at optimality, the supply for the i warehouses will be completely filled before the corresponding i’ warehouses will ship, which will give, as an optimal solution, an answer that adheres to our restriction that the first n i units must all be shipped before the surcharge is in effect. B. No. This formulation gave correct solutions only because it was cheaper to ship the first n i units first. If p i is negative, it now becomes cheaper to ship from the i’ warehouses, which would mean the supply for the i’ warehouses will fill before the units from the i warehouses are shipped. This leads to a solution where units with
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 09/07/2011 for the course OR 1101 taught by Professor Trotter during the Fall '09 term at Cornell University (Engineering School).

Page1 / 5

PS6_solutions - 1. A. For each warehouse i, add a warehouse...

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