Question

Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1...

  1. 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.

  1. Use Excel Solver to solve this problem.
  2. Write out the augmented form of this problem by introducing slack variables.
  3. Work through the simplex method step by step in tabular form to solve the problem.
Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
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?
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3=...
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3= 1 2X1+ X2≤3 X2, X3 ≥0, X1 urs a) Find the standard form of the LP problem. b) Find the starting tableau to solve the Primal LP problem by using the M-Technique.
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual...
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual model b.) Given the information that the optimal basic variables are X1 and X3, determine the associated optimal dual solution.
Solve the LPP below by making use of the dual simplex method. min z=2x1+3x2+4x3 st: x1+2x2+x3>=3...
Solve the LPP below by making use of the dual simplex method. min z=2x1+3x2+4x3 st: x1+2x2+x3>=3    2x1-x2+3x3>=4    x1,x2,x3>=0
Max Z = X1 - X2 + 3X3 s.t. X1+X3 = 5 X1+X2 <= 20 X2+X3...
Max Z = X1 - X2 + 3X3 s.t. X1+X3 = 5 X1+X2 <= 20 X2+X3 >= 10 X1 , X2 , X3 >= 0 a) Put the problem into standard form, using slack, excess, and artificial variables. b) Identify the initial BV and NBV along with their values. c) Modify the objective function using an M, a large positive number. d) Apply the Big M method to find the optimal solution
max Z = 5x1+3x2+x3 s.t : 2x1+x2+x3 < 6 x1+2x2+x3 < 7 x1, x2, x3 >...
max Z = 5x1+3x2+x3 s.t : 2x1+x2+x3 < 6 x1+2x2+x3 < 7 x1, x2, x3 > 0 Solve the problem. What is the optimal value of the objective function (OF)? Decision variables? Solve the problem. What is the optimal value of the objective function (OF)? Decision variables? (20 points)
Consider the following linear program Max 5x1+5x2+3x3 St x1+3x2+x3<=3 -x1+ 3x3<=2 2x1-x2 +2x3<=4 2x1+3x2-x3<=2 xi>=0 for...
Consider the following linear program Max 5x1+5x2+3x3 St x1+3x2+x3<=3 -x1+ 3x3<=2 2x1-x2 +2x3<=4 2x1+3x2-x3<=2 xi>=0 for i=1,2,3 Suppose that while solving this problem with Simplex method, you arrive at the following table: z x1 x2 x3 x4 x5 x6 x7 rhs Row0 1 0 -29/6 0 0 0 11/6 2/3 26/3 Row1 0 0 -4/3 1 0 0 1/3 -1/3 2/3 Row2 0 1 5/6 0 0 0 1/6 1/3 4/3 Row3 0 0 7/2 0 1 0 -1/2 0...
Maximize 12X1 + 10X2 + 8X3             Total Profit Subject to      X1 + X2 + X3 >...
Maximize 12X1 + 10X2 + 8X3             Total Profit Subject to      X1 + X2 + X3 > 160        At least a total of 160 units of all three products needed                  X1 + 3X2 + 2X3 ≤ 450         Resource 1                  2X1 + X2 + 2X3 ≤ 300         Resource 2                2X1 + 2X2 + 3X3 ≤ 400         Resource 3                   And X1, X2, X3 ≥ 0 Where X1, X2, and X3 represent the number of units of Product 1, Product...
minimize F=5x1 - 3x2 - 8x3    subject to (2x1 + 5x2 - x3 ≤1) (-2x1...
minimize F=5x1 - 3x2 - 8x3    subject to (2x1 + 5x2 - x3 ≤1) (-2x1 - 12x2 + 3x3 ≤9) (-3x1 - 8x2 + 2x3 ≤4) x1,x2,x3≥0 solve implex method pls.
Consider the following linear programming optimization problem: min z = x1 - x2 + x3 x1...
Consider the following linear programming optimization problem: min z = x1 - x2 + x3 x1 + 2x2 - x3 ≤ 3 - x1 + x2 + x3 ≥ 2 x1 - x2 = 10 x1 ≥ 0, x2 ≥ 0 Convert the problem into a standard maximum problem and then write its dual form. Please write the answer clearly and legibly
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT