OPER2235 Study Guide - Final Guide: Shadow Price, Outsourcing, Structure Of Policy Debate

• School: Boston College
• Department: Operations Management
• Course: OPER2235
• Professor: Graves

Document Summary

[demand con1: x11 + x21 = 25] [xij > 0] Add constraints, if closed then = 0, or just < x. Transhipment: same thing as transportation, just have middle nodes. Add constraints for these nodes such that [flow in] - [flow out] = 0. Shortest route: similar to the rest, but total supply and demand = 1. 0. All constraints should be [flow in] - [flow out] = 0. All integer: [dv: whatever you"re getting (s or l) [max z = 1s + 5l] [constraints: whatever they are, also then (s, l >= 0/integers) Integer linear program: [dv: x1-4, 0 if false, 1 if true] [max z = 100x1. + 50x2 etc] [constraints (4 total): 10x1 + 30x2 + 5x3 + 10x4 <= 40] Dv: {xij: units shipped from i to j} {yi: 1 if site is used, else. 0} [min z = 30x11 + 25x12 + +2,500,000y1 +