MS&E 107 Lecture Notes - Lecture 14: Feasible Region, Linear Programming, Applied Mathematics
13 Nov 2016
School
Department
Course
Professor
Document Summary
Convex is not always better than concave. Green lines: constraint lines on graph - different lines depending on the type of boat. The constraints are supplies needed to build different boats. The region bounded by the three lines are the feasible region. Bounded by straight lines, objective contours are straight lines, solution is always in a corner, there will always be a solution at a corner even if there are multiple feasible regions. Best solution is always in a corner. Generalizing for 3 boats: region of feasibility becomes box. Nonlinear problems - no stability , shape like glove, wok, where ball does not get stuck in corner. Linear function: pure math definition is f(x+y)=f(x)+f(y), f(ax)=af(x, applied math: i = f x ci, punk math?! Try anything, then use excel solver and hope that you don"t get error message. Example: warehouse on fire, need to load trucks with fixed capacity. Tradeoff curve graph - sales versus inventory cost.
