BU275 Lecture Notes - Lecture 12: Shadow Price, Truth Table, Feasible Region
Document Summary
X1,x2(cid:3410)0: shade the feasible region (do not solve, graphing trick: X2-int: 1/-1=-1: put x2 on the y-axis, you don"t have to shade the individual lines unless explicitly told to. Possible problem #2: lp and lines given, label all the points, some points are infeasible, locating corner points by solving system of 2 eqs" not covered, solution: Find feasible region (by shading each line or not. Corner point method: (3,2) z=2(3)+1(2)=8* since it"s a min problem optimal (5,0) z=2(5)+1(0)=10. We should check if the problem is unbounded if the line that the corner point is on stretches infinitely. Min 2x1+x2 is obviously heading towards 0. Another way to check: point along the line of the corner point: (4,3) Got worse, so (3,2) optimal solution for sure. If it had gotten smaller, it would be unbounded. If unbounded: no optimal solution exists, ofv:+/- infinity: if not sure about feasible region. Check a point not on the line: (3,5)
