Systems of Inequalities / Linear Programming
- Alex Hillerns
Constraints: 3x+3y >= 12 2x+4y >= 12 x >= 0 y >= 0 Minimize: C = 6x + 5y b) If the first two constraints were <= and you were maximizing the same objective function, what would the new answer be?
You may use this applet to find feasible regions for your portfolio, then draw the feasible region on your portfolio and show the rest of the work. Portfolios must contain the work shown on the objective function calculations for full points. If you have any questions please visit our LiveLesson™.