BU275 Study Guide - Final Guide: Linear Programming Relaxation, Proj Construction, Round Number
Document Summary
Must select 1, not both = mutually exclusive: x1 + x2 + x3 + x4 + x5 + x6 2 (at least) Can select at most or least = mutually exclusive: x1 + x4 + x5 + x6 2. 1 2 3: web site, warehouse, clothing department, computer department, atms. When y1 = 1, and y2 = 0, pine becomes initial, and. Objective fun: min z = 18x1a+ 15x1b+ 12x1c+ 13x2a+ Ip are very sensitive to changes in parameters. Adding machines and decide which to maximize profit. X1: profit = 100, cost = 8,000, space = 15. X2: profit = 150, cost = 4,000, space = 30 o o o. 0-1 (binary) integer (hold a or b constant) If the variable is chosen in the optimal solution, Gives a yes or no answer o. : x1 + x2 < 1 (can be either) Choose between 3 things to invest in (max) X1 (condo): cost = 50,000, profit = 9,000,
