Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...

Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function.

Maximize Z = 2A + 10B

Subject to

10A + 4B ≥ 40

A + 6B ≥ 24

A + 2B ≤ 14

A, B ≥ 0

with soln pls thank you!

Solutions

Expert Solution

Colby Messinger answered 1 year ago

Next > < Previous

Related Solutions

For the following LP problem, determine the optimal solution by the graphical solution method. Min Z=...

For the following LP problem, determine the optimal solution by the graphical solution method. Min Z= 3x1+2x2 Subject to 2x1+x2 >10 -3x1+2x2 < 6 X1+x2 > 6 X1,x1 > 0 Graph and shade the feasible region

Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and...

Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and the minimum cost. (Leave no cells blank - be certain to enter "0" wherever required. Omit the "$" sign in your response.) Minimize 8x11 + 2x12 + 5x13 + 2x21 + x22 + 3x23 + 7x31 + 2x32 + 6x33 Subject to x11 + x12 + x13 = 90 x21 + x22 + x23 = 105 x31 + x32 + x33 = 105 x11...

Solve the following LP problem using graphical solution method. MAX: 5 X1 + 3 X2 Subject...

Solve the following LP problem using graphical solution method. MAX: 5 X1 + 3 X2 Subject to: 2 X1 − 1 X2 ≤ 2 6 X1 + 6 X2 ≥ 12 1 X1 + 3 X2 ≤ 5 X1, X2 ≥ 0

Identify the type of optimal solution for the following LP problems by the graphical solution method....

Identify the type of optimal solution for the following LP problems by the graphical solution method. Show your work (1) Min 2X1 + 3X2 S.T. 2X1 - 2X2 <= 2 -2X1 + X2 <= 1 X1 => 0, X2 => 0 If the objective function of the above formulation is changed from Min 2X1 + 3X2 to Max 2X1 + 3X2, what type of optimal solution does this problem provide? Note that all constraints remain...

Find the optimal values of x and y using the graphical solution method: Max x +...

Find the optimal values of x and y using the graphical solution method: Max x + 5y subject to: x + y ≤ 5 2x + y ≤ 8 x + 2y ≤ 8 x ≥ 0, y ≥ 0

For the following linear programming problem, determine the optimal solution by the graphical solution method Max...

For the following linear programming problem, determine the optimal solution by the graphical solution method Max -x + 2y s.t. 6x - 2y <= 3 -2x + 3y <= 6 x + y <= 3 x, y >= 0

solve the following LP. Formulate and algebraically solve the problem. what is the new optimal z...

solve the following LP. Formulate and algebraically solve the problem. what is the new optimal z value show that the current basis is optimal max z=65x1+25x2+20x3 8x1+6x2+x3<=48 4x1+2x2+1.5x3<=20 2x1+1.5x2+0.5x3<=8 x2<=5 x1,x2,x3>=0

Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter...

Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED. Note that an unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] Maximize and minimize p = x + 2y subject to x + y ≥ 4 x + y ≤ 10 x − y ≤ 4 x...

Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter...

Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED. Note that an unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] Minimize c = 2x − 2y subject to x 6 ≤ y y ≤ 2x 3 x + y ≥ 10 x + 2y ≤ 35...

Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty...

Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = 0.2x + 0.3y subject to 0.2x + 0.1y ≥ 1 0.15x + 0.3y ≥ 1.5 10x + 10y ≥ 80 x ≥ 0, y ≥ 0. c = (x, y) =

Subjects