Question: solve it quickly please Graphically solve the following problem: (You should provide hand drawing) Maximize Profit = 8 X1 + 5 X2 subject to X1

solve it quickly please

Graphically solve the following problem: (You should provide hand drawing) Maximize Profit = 8 X1 + 5 X2 subject to X1 + X2 10 X156 X1, X220 On the diagram below: a. Graph the constraints in the figure (15 pts) b. Shade the feasible region (10 pts) c. Identify, label and calculate the optimal solution. (15 pts) 14 12 10

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

Please solve in tabular form. Thanks! Solve the following problem by the two phase method. maximize Z = x1 + x2 2x3 + 2x 4 subject to x1 X2 X3 2x4 > 2 X1 + x2 + x4 0

Page 1 of 2 Q 1 . Solve the following problem, using the Corner Point Method. Maximize profit = 3 0 x 1 + 4 0 x 2 Subject to 4 x 1 + 2 x 2 = 1 6 2 x 1 x 2 > = 2 x 2 = 2 x 1 , x 2 > = 0 a ) Draw lines...

Consider the following model: Maximize Profit = 2x1 + x2, subject to 3x1 + x2 15 x1 + 2x2 10 and x1 0, x2 0. You are given that its corner points are (0, 0), (5, 0), (4, 3), and (0, 5). a. Use the...

Solve the linear programming problems by drawing the feasible solution region and using the corner point table. 1.1 Maximize: P = 20x + 10y subject to: 3x + y 21 x + y 9 x + 3y 21 x, y 0 1 .2...

2-2 Graphically solve the following parts. PLEASE USE EXCEL TO SOLVE. You need to show the graph and how you created them. Please show all your work, formula's and calculations for your answers....

Q2. (30 marks) Consider the following problem: Maximize Z = X1 + 3X2 Minimize Z2 = 4X1 + X2 Subject to 5X1 +2X2 10 X1 > 0, X2 > 0 a. Solve the problem separately for goal Z and Z2 (15 marks) b. Using...

TOPIC: LINEAR PROGRAMMING 1.) Is the problem in standard form? Do not attempt 2.) Determine whether the following minimum to solve it. problem is in standard form. Maximize P = 4X1 + X2 subject to...

please show work, typing it out would help out a lot but if you have to do it by hand that works too and some answers will be in fraction form as follows -2/3 and thank you in advance Question 1 5...

PROBLEM 1. Consider the following problem. Maximize Z = x1 + 2x2 subject to x1 2 x2 2 x1 + x2 0 (a) Plot the feasible region and circle all the CPF solutions (use IOR Tutorial). (b) For each CPF...

Consider the following IP problem: (Similar to Problem 11.7-2 in the 9th edition.) Maximize Z = -3x1 + 5x2, subject to 5x17x2 > 3, X1 0, x2 > 0, X1, X2: integer. a) Solve this problem graphically and...

In ABC, prove that 4(rr + rr + rr) = (a + b + c).

Account for the following purchases in a purchases journal using Accounts Payable (acct. #207), Account for the following purchases in a purchases journal using Accounts Payable (acct. #207),...

Increased track densities for computer disk drives necessitate careful design of the head positioning control [1]. The loop transfer function is == == L(s) G(s)G(s) = K (s + 2) Plot the frequency...

Please answer the following questions: 1) Explain what is meant by negative externalities. 2) Describe how an over allocation of resources results when negative externalities costs are present. 3)...