BU385 Study Guide - Final Guide: Work Breakdown Structure, Linear Programming Relaxation, Shadow Price
Document Summary
2. if a decision variable is added or deleted, you have to re-solve to obtain new optimal solution and new. 4. add a new constraint (if the current optimal solution satisfies it, no change; otherwise, must re-solve. ) 5. delete a constraint (if nonbinding, no change; otherwise, must re-solve. ) Change within allowable range: i)basic variable: os unchanged, new. Ofv= old ofv+ change*value of dv ii)non-basic variable: os and ofv both unchanged. Reduced costs for basic variables are zeros (note: basic variables are ones with non-zero final values) Negative for max problems (allowable increase= absolute value of reduced cost, allowable decrease= infinity) Positive for minimization problems (allowable increase= infinity, allowable decrease= reduced cost) Change within allowable range: i)binding constraint: resolve to find new os, new ofv= old ofv+ change*shadow price ii)non-binding constraint: os and. Change in oc of at least 1 basic variable: use 100% rule: New ofv= old ofv+ change 1*value of dv+ change 2* value of dv.
