Question

Consider the following linear programming problem. Maximize        6X1 + 4X2 Subject to:                     &nbs

Consider the following linear programming problem.

Maximize        6X1 + 4X2

Subject to:

                        X1 + 2X2 ≤ 16

                        3X1 + 2X2 ≤ 24

                        X1  ≥ 2

                        X1, X2 ≥ 0

Use Excel Solver to find the optimal values of X1 and X2. In other words, your decision variables:

a.

(10, 0)

b.

(12, 2)

c.

(7, 5)

d.

(0, 10)

Homework Answers

Answer #1

Putting the Equation in Excel:

Solver Parameters:

Optimal Solution:

Answer is: X1 = 8; X2 = 0

Given options, none of them are correct.

None of the options get fit with constraint 3X1 + 2X2 <= 24

For a (10,0): 30 is not less than 24

For b (12,2): 36 is not less than 24

For c (7,5): 31 is not less than 24

For d (0, 10): Constraint X1 + 2X2 <= 16 doesn’t fit as 20 is not less than 16

Hence answer should be none of the given options.

********

IF YOU HAVE ANY DOUBT, KINDLY COMMENT. I WOULD LOVE TO HELP YOU!!!

IF YOU LIKE THE ANSWER, PLEASE GIVE AN UP-VOTE OR THUMB UP. THIS WILL ENCOURAGE ME TO ANSWER MORE!!

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
** Linear Programming ** max 6x1 + 10x2+9x3 + 20x4 Subject to 4x1 + 9x2 +...
** Linear Programming ** max 6x1 + 10x2+9x3 + 20x4 Subject to 4x1 + 9x2 + 7x3 + 10x4 ≤ 600 x1 + x2 +3x3 + 40x4 ≤ 400 3x1+ 4x2 + 2x3 + x4 ≤ 500 x1,x2,x3,x4 ≥ 0 List all the complementary slackness equations.
Consider the following linear programming problem: Maximize 40 X1 + 30 X2 + 60X3 Subject to:...
Consider the following linear programming problem: Maximize 40 X1 + 30 X2 + 60X3 Subject to: X1 + X2 + X3 ≥ 90 12 X1 + 8 X2 + 10 X3 ≤ 1500 X1 = 20 X3 ≤ 100 X1 , X2 , X3 ≥ 0 How many slack, surplus, and artificial variables would be necessary if the simplex algorithm were used to solve this problem?
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1...
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1 + 2X2 > (or equal to) 80 3X1 + X2 > (or equal to) 75 X1, X2 > 0
Solve the following linear programs graphically. Minimize            Z = 6X1 - 3X2 Subject to            2X1 +...
Solve the following linear programs graphically. Minimize            Z = 6X1 - 3X2 Subject to            2X1 + 5X2 ≥ 10                             3X1 + 2X2 ≤ 40                            X1, X2 ≤ 15
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1...
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1 - x2 + 3x3 ≤   4             2x1 + x2           ≤ 10             x1 - x2 -    x3 ≤   7 and       x1 ≥ 0,   x2 ≥ 0,    x3 ≥ 0. Use Excel Solver to solve this problem. Write out the augmented form of this problem by introducing slack variables. Work through the simplex method step by step in tabular form to solve the problem.
** Linear Programming ** Max Z = 6x1 + 10x2+9x3 + 20x4 constraint 4x1 + 9x2...
** Linear Programming ** Max Z = 6x1 + 10x2+9x3 + 20x4 constraint 4x1 + 9x2 + 7x3 + 10x4 = 600 x1 + x2+3x3 + 40x4= 400 3x1 + 4x2 + 2x3 + x4 = 500 x1,x2,x3 ,x4 ≥ 0 Find the allowable decrease and increase for x4.
Using the graphical method, described in class, determine the optimal solution(s) (if they exist) for the...
Using the graphical method, described in class, determine the optimal solution(s) (if they exist) for the linear program. If no optimal exists, then indicate that and explain why no optimal solution exists. (a) Maximize : z = 2x1 + 8x2 Subject to : 3x1 ≤ 12 x1 + 4x2 ≤ 24 x1 ≥ 0 x2 ≥ 0 (b) Maximize : z = 2x1 − 3x2 Subject to : 6x1 − 3x2 ≤ −9 x1 ≤ 0 x2 ≤ 0
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 +...
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 + X2 ≤ 4 Constraint A X1 - X2 ≤ 1 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Z - X1...
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject...
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject to 2x1 – 6x2 ≤ 12 5x1 + 4x2 ≥ 40 x1 +2x2 ≥ 12 x2 ≤ 6 x1, x2 ≥ 0
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT