Find the complete optimal solution to this linear programming problem. Max 5x + 3y s.t. 2x...

Question

Question

Find the complete optimal solution to this linear programming problem. Max 5x + 3y s.t. 2x + 3y £ 30 2x + 5y £ 40 6x - 5y £ 0 x , y ³ 0

Answer 1

Answer #1

Using excel solver,we find the optimal solution as shown below :

In excel ,

Objective function value=G6=SUMPRODUCT(C4:D4,C6:D6)=43

E9=SUMPRODUCT($C$4:$D$4,C9:D9)

E10=SUMPRODUCT($C$4:$D$4,C10:D10)

E11=SUMPRODUCT($C$4:$D$4,C11:D11)

The optimal solution is ,

x=5 ; y=6

Calculations are as shown below :

Add a comment

Answer 2

Similar Homework Help Questions

Find the complete optimal solution to this linear programming problem (using Excel) and enter the optimal...

Find the complete optimal solution to this linear programming problem (using Excel) and enter the optimal x value. Max 5X + 6Y s.t. 3X + Y <= 15 X + 2Y <= 12 3X + 2Y <= 24 X , Y >= 0 Find the complete optimal solution to this linear programming problem using Excel and type in the optimal value of X below (X*=?). Max 2X + 3Y s.t. 4X + 9Y <= 72 10X + 11Y <= 110...
Consider the following linear program: Max 2X + 3Y s.t. 5X +5Y ≤ 400 -1X+ 1Y...

Consider the following linear program: Max 2X + 3Y s.t. 5X +5Y ≤ 400 -1X+ 1Y ≥ 10 1X + 3Y ≥ 90 X, Y ≥ 0 a. Use the graphical solution procedure to find the optimal solution. b. Conduct a sensitivity analysis to determine the range of optimality for the objective function coefficients X & Y. c. What are the binding constraints? d. If the right-hand-side of the binding constraints are marginally increased, what will be the Dual Value?
Your problem is to find the optimal solution to the following linear programming model where X,...

Your problem is to find the optimal solution to the following linear programming model where X, Y and Z represent the amounts of products X, Y and Z to produce in order to minimize some cost. Min 4X + 2Y + 6Z s.t. 6X + 7Y + 10Z ≤ 80 (1) 2X + 4Y + 3Z ≤ 35 (2) 4X + 3Y + 4Z ≥ 30 (3) 3X + 2Y + 6Z ≥ 40 (4) X,Y,Z ≥...

Consider the following integer program Max 2x+3y s.t 6x+7y23 x-y

Consider the following integer program Max 2x+3y s.t 6x+7y23 x-y<12 xy0 x,y: integer Let V1 denote the optimal objective value of the above optimization problem. Let V2 denote the optimal objective value of the optimization problem obtained by dropping "x,y: integer" constraint. Similarly, let V3 denote the optimal objective value of the optimization problem obtained by dropping "x-y<-12" constraint which one of the following statements is correct? a. V2 V1 and V3<-V1 b. V1 V2 and V1<-V3 c. V2V1 but...
For the following linear programming problem a. change to standard for; b. use graphical approach to...

For the following linear programming problem a. change to standard for; b. use graphical approach to find complete optimal solutions(X, Y and optimal objective function value) Max 5X+6Y s.t. 3X+Y <= 15 X+2Y <= 12 3X+2Y <= 24 X, Y >= 0
10. For the following linear programming problem, determine the optimal solution by the graphical solution method....

10. For the following linear programming problem, determine the optimal solution by the graphical solution method. Are any of the constraints redundant? If yes, then identify the constraint that is redundant. Max x + 2y s.t. x + y<= 3 x - 2y >=0 y<= 1 x, y >= 0 Please show all work in excel and step by step with formulas no solvers mode.

Consider the following linear programming problem: Minimize 20X + 30Y Subject to: 2X + 4Y ≤ 800 &nbs

Consider the following linear programming problem: Minimize 20X + 30Y Subject to: 2X + 4Y ≤ 800 6X + 3Y ≥ 300 X, Y ≥ 0 What is the optimum solution to this problem (X,Y)? A) (0,0) B) (50,0) C) (0,100) D) (400,0)
Given the following linear program that maximizes revenue (assume x and y cannot be negative): Max...

Given the following linear program that maximizes revenue (assume x and y cannot be negative): Max Z = 15x + 20y s.t. 5x + 5y ≤ 40 4x + y ≤ 4 What is the maximum revenue at the optimal solution? $185 $120 $80 $200
Graphical Method of Linear Programming 3. Find the minimum value of the objective function z =...

Graphical Method of Linear Programming 3. Find the minimum value of the objective function z = 5x + 7y, where x = 0 and y 0, subject to the constraints a. 2x + 3y 26 b. -x + y S4 c. 3x-y = 15 d. 2x + 5y = 27.

4. Given the following linear programming problem, determine which situation (choose one) a. An optimal solution...

4. Given the following linear programming problem, determine which situation (choose one) a. An optimal solution exists at a single vertex point. b. There is more than one optimal solution. C. There is no optimal solution because the feasible region does not exist d. There is no optimal solution because the feasible region is unbounded. Maximize: 2x +3y Subject to: x +2y 28 5. Graph the inequality: 2x +3y >12 6. Graph the system of inequalities: 7. Graph the system...