Consider the following linear program: Max x + 10x2 s. t. 4 x + 3x ...

Transcribed Image Text:

Consider the following linear program: Max x₁ + 10x2 s. t. 4 x₁ + 3x₂ ≤ 36 2x₁ + 4x₂ ≤ 40 X₂ ≥ 3 x₁ ≥ 0 x₂ ≥ 0 a) Represent the constraints and the feasible region on a two-dimensional graph (You can use the blank graph provided. If it is not easy to draw on Word, you can copy the graph to PowerPoint, draw lines there, and copy it back). b) Draw the isoprofit lines and identify the optimal solution graphically. c) What is the slack of the first two constraints? Which constraints are binding at the optimal solution? d) Use Excel Solver to solve the LP and include the answer report in your submission. Consider the following linear program: Max x₁ + 10x2 s. t. 4 x₁ + 3x₂ ≤ 36 2x₁ + 4x₂ ≤ 40 X₂ ≥ 3 x₁ ≥ 0 x₂ ≥ 0 a) Represent the constraints and the feasible region on a two-dimensional graph (You can use the blank graph provided. If it is not easy to draw on Word, you can copy the graph to PowerPoint, draw lines there, and copy it back). b) Draw the isoprofit lines and identify the optimal solution graphically. c) What is the slack of the first two constraints? Which constraints are binding at the optimal solution? d) Use Excel Solver to solve the LP and include the answer report in your submission.