Compare how the corner-point and iso-profit line methods work for solving graphical problems.
Answer to relevant QuestionsWhere a constraint crosses the vertical or horizontal axis, the quantity is fairly obvious. How does one go about finding the quantity coordinates where two constraints cross, not at an axis?Consider the following linear programming problem: Maximize profit = 30X1 + 10X2 Subject to: 3X1 + X2 ≤ 300 X1 + X2 ≤ 200 X1 ≤ 100 X2 ≥ 50 X1 – X2 ≤ ...Kalyan Singhal Corp. makes three products, and it has three machines available as resources as given in the following LP problem:Maximize contribution = 4X1 + 4X2 + 7X3Subject to: 1X1 + 7X2 + 4X3 ≤ 100 (hours on machine ...How many corner points are there in the feasible region of the following problem? Minimize cost = X – Y Subject to: X ≤ 4 – X ≤ 2 X + 2Y ≤ 6 – X + 2Y ≤ 8 Y ≥ 0What are the steps in the intuitive lowest-cost method?
Post your question