Question

Consider this problem and answer the following questions. Maximize      Z = 2x1 + 3x2           s.t....

Consider this problem and answer the following questions.

Maximize      Z = 2x1 + 3x2

          s.t.

                               x1   +   2x2 <= 30

                               x1    +    x2   <= 20

                               x1,          x2   >= 0

  1. Solve the problem graphically in a free hand manner and identify all the CPFs.
  2. Use hand calculation to solve the problem by the simplex method in algebraic form
  3. Additional:
  1. What can you say about the solution if the RHS of the second constraint was 16? (i. e. b2 = 16), How about b2 = 14? What is the new solution? Also show these cases graphically.
  2. What if the RHS of the first constraint was 25? Does the solution change? if so, show how does it change?
  3. What if the coefficient of x1 in the objective function was 4? How does the solution change? Also show these cases graphically.

Homework Answers

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
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2...
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2 ≥ 10 x1 – x2 = 4 0.5x1 + 2x2 ≤ 20 x1 ≥ 0, x2 unconstrained Please provide an excel solution to this problem
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)
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 problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 +...
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 + 8x2 ≤ 12 (N) x1 ≥ 0, x2 ≥ 0 and the following possible market equilibria: i) x1 = 0, x2 = 3/2, pK = 0, pN = 1/4, ii) x1 = 1, x2 = 2, pK = 2, pN = 1, iii) x1 = 1, x2 = 2, pK = 4, pN = 0, iv) x1 = 5, x2 = 0, pK =...
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
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.
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2 ≤ 4      5x1+ 3x2 ≤15       x1,x2 ≥ 0 Graph the region that satisfies the constraints. Find the optimal solution and the value of the objective function at the optimal solution.
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤...
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤ 80 5X1 + 2X2 ≤ 80 X1≥ 0 , X2≥0
Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤...
Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤ 12 2x1 + 3 x2 = 12 2 x1 + x2 ≥ 8 x1≥ 0, x2 ≥ 0 What is the optimal solution of this LP? (0,8)(12,0)(4,0)(0,4)(2,3)(0,6)(3,2) I NEED SOLUTION!
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...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT