Question

In: Operations Management

Consider the following linear programming problem, and find the solution graphically in excel.                         Maximize &nbs

  1. Consider the following linear programming problem, and find the solution graphically in excel.

                        Maximize                     4X + 10Y

                        Subject to:                    3X + 4Y <= 480

                                                            4X + 2Y <= 360

                                                            2X + 3Y >= 90

                                                            all variables >= 0

Solutions

Expert Solution

To find the solution, we can find plot the given constraint on the graph and the find the feasible solution area. We then find the value of the objective function at the corner points of the feasible solution. The point where the objective function has the maximum value is the solution.

The graph of the equation and the feasible area is shown in the below image

We can see that there are 5 corner points of the feasible solution.

A (0,120), B(48, 84) C(90,0) D(45,0) E (0,30)

We find the value of objective function 4X+10Y at each of the corner points

Value at A (0,120) : 4*0+10*120 = 1200

Value at B (48,84) : 4*48+10*84 = 1032

Value at C (90, 0) : 4*90+10*0 = 360

Value at D (45,0) : 4*45+10*0 = 180

Value at E (0,30) : 4*0+10*30 = 300

We can see that the maximum value of objective function occurs are A (0,120).

Hence the solution is X = 0 and Y =120. The value of objective function at optimal solution is 1200.


Related Solutions

Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤...
Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤ 520 3X + 2Y ≤ 320 all variable ≥ 0 The maximum possible value for the objective function is
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 +...
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 + 3x2 + x3 ≥ 30 2x1 + x2 + x3 ≤ 50 4x1 + 2x2 + 3x3 ≤ 120 x1, x2, x3 ≥ 0 a) Find the optimal solution by using simplex method b) Find the dual price for the first constraint. c) Find the dual price for the second constraint. d) Find the dual price for the third constraint. e) Suppose the right-hand...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   Answer ≤ C1/C2  ≤  Answer b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   .......... ≤ C1/C2  ≤  ............ b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
Consider the following linear programming problem: Maximize 10X + 8Y Subject to: 40X + 24Y <=...
Consider the following linear programming problem: Maximize 10X + 8Y Subject to: 40X + 24Y <= 600 20X + 30Y <= 480 all variables >= 0
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
You are a manager that uses Excel to find the optimal solution to a linear programming...
You are a manager that uses Excel to find the optimal solution to a linear programming problem. Before implementing the solution, what should you do?
Use the graphical method for linear programming to find the optimal solution for the following problem....
Use the graphical method for linear programming to find the optimal solution for the following problem. Maximize P = 4x + 5 y subject to 2x + 4y ≤ 12                 5x + 2y ≤ 10 and      x ≥ 0, y ≥ 0. graph the feasible region
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT