This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Two-Variable LP Homework STOR 112 70 points written work + 30 points computer work 1. (10 points) Consider the following linear program: max p = x + 2 y subject to 30 x + 20 y ≤ 600 . 1 x + 0 . 4 y ≤ 4 . 2 x + 0 . 3 y ≤ 4 . 5 x,y ≥ (a) Graph the feasible region. (b) Make a table of the extreme points. For each point, list the objective value at that point and which constraints are binding at that point. Indicate which corner point is the optimal one. 2. (30 points) Podunk Institute of Technology’s Math Department offers two courses: Finite Math and Applied Calculus. Each section of Finite Math has 60 students, and each section of Applied Calculus has 50. The department is allowed to offer up to 110 sections total. Furthermore, no more than 6000 students want to take a math course, and no student will take more than one math course. Suppose the university makes a profit of $100,000 on each section of Finite Math and $50,000 on each section of Applied Calculus....
View Full Document
- Spring '06
- Optimization, feasible region