OIDD 101 Study Guide - Final Guide: Shadow Price, Linear Programming

• School: UPenn
• Department: Operations, Information and Decisions
• Course: OIDD 101
• Professor: Lorin Hitt

Document Summary

Linear programming (lp) a mathematical method for determining a way to achieve the best outcome in a given mathematical model for some list of requirements represented as linear equations. Network & distribution number of decisions variables is the number of possible paths in the network. Write a constraint to ensure capacity is met. Describe the change in the optimal value of the o after a small change in the model * valid for only one change. Solve for of ( ) ( ) What is the allowable decrease? (given fv & rhs or given slack) Adjustable cells: talks about the robustness of the coefficients. Final value (fv) the fv of the dv"s that satisfy optimal solution. Reduced cost how much the obj. coefficient must be improved for the. Allowable range (increase/decrease) amount you can change oc w/o changing fv of dv"s.