Question

Maximize:-x 3x2 subject to: + S8 (resource 1). -xx (resource 2). s6 (resource 3). xi20.x2 20. The optimal tableau determined
0 0
Add a comment Improve this question Transcribed image text
Answer #1

i)

Refer final values from the optimal tableau

The optimal solution is following:

x1 = 2

x2 = 6

ii)

Refer the values in the last row of optimal tableau,

Shadow price of first constraint is 2

Shadow price of second constraint is 1

iii)

Holding the coefficient of x2 constant, the optimality range of x1 is from: __-3__  (=1-2/(1/2)) to __3__ (=1-1/(-1/2))

Holding the coefficient of x1 constant, the optimality range of x2 is from: __1__  (=3-1/(1/2)) to __infinity__ (=3+0/0)

iv)

Holding the availabiility of other resources constant the feasibility range of constraints' Right Hand Sides (RHSs) are following:

Feasibility range of RHS of first constraint is from: __5__ (=8-3) to __17__ (=8+9)

Feasibility range of RHS of second constraint is from: __-4__ (=5-9) to __8__ (=5+3)

Feasibility range of RHS of third constraint is from: __1.5__ (=6-4.5) to __infinity__ (=6+infinity)

Add a comment
Know the answer?
Add Answer to:
Maximize:-x 3x2 subject to: + S8 (resource 1). -xx (resource 2). s6 (resource 3). xi20.x2 20. The...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Basic variablesvales Current x1 x2 rs 2)20 Using the above optimal tableau determined by the simp...

    Basic variablesvales Current x1 x2 rs 2)20 Using the above optimal tableau determined by the simplex method, determine: i) the optimal solution: i the shadow prices on the three constraints the range on the objective coefficient of each variable, holding the coefficient of the other variable at its current value, for which the solution to part ()remains optimal: v) the range on the availability of each resource, holding the availability of the other resources at their current values, for which...

  • 1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using ...

    1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using the simplex algorithm gave the final tableau T4 T5 #210 1-1/4 3/8-1/812 0 0 23/4 3/8 7/8 10 (a) (3 points) Add the constraint -221 to the final tableau and use the dual simplex algorithm to find a new optimal solution. (b) (3 points) After adding the constraint of Part (a), what happens to the optimal solution if we add the fourth constraint 2+...

  • 4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54...

    4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54 x1 + x2 = 3 and X120, X2 0. DI (a) Solve this problem graphically. (b) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable. I (c) Continue from part (b) to work through the simplex method step...

  • [4.37] Consider the following problem: Maximize 2x + 3x2 subject to X1 + 2x2 5 10...

    [4.37] Consider the following problem: Maximize 2x + 3x2 subject to X1 + 2x2 5 10 -*1 + 2x2 s 6 *1 + *2 S6 12 0. a. c. X1, Solve the problem graphically and verify that the optimal point is a degenerate basic feasible solution. b. Solve the problem by the simplex method. From Part (a), identify the constraint that causes degeneracy and resolve the problem after deleting this constraint. Note that degeneracy disappears and the same optimal solution...

  • SOLVE STEP BY STEP! 4. Consider the following LP: Minimize z = x; +3x2 - X3...

    SOLVE STEP BY STEP! 4. Consider the following LP: Minimize z = x; +3x2 - X3 Subject to x + x2 + x2 > 3 -x + 2xz > 2 -x + 3x2 + x3 34 X1 X2,43 20 (a) Using the two-phase method, find the optimal solution to the primal problem above. (b) Write directly the dual of the primal problem, without using the method of transformation. (c) Determine the optimal values of the dual variables from the optimal...

  • UESTION 2 (TOTAL 13 MARKS a. Given the following initial simplex tableau 12 0 Sol asis CB 80 15 20 250 20 12 i. What va...

    UESTION 2 (TOTAL 13 MARKS a. Given the following initial simplex tableau 12 0 Sol asis CB 80 15 20 250 20 12 i. What variables form the basis? (1 mark) ii. What are the current values of the decision variables? (1 mark) iii. What is the current value of the objective function? (1 mark) iv. Which variable will be made positive next, and what will its value be? Which variable that is currently positive will become 0? (2 marks)...

  • This is question 5.3-5 from Introduction to Operations Research (Hillier). Relevant text: Consider the following problem....

    This is question 5.3-5 from Introduction to Operations Research (Hillier). Relevant text: Consider the following problem. Maximize Z= cixi + c2x2 + C3X3 subject to x1 + 2x2 + x3 = b 2x1 + x2 + 3x3 = 2b and x 20, X220, X2 > 0. Note that values have not been assigned to the coefficients in the objective function (C1, C2, C3). and that the only specification for the right-hand side of the functional constraints is that the second...

  • 2. Consider the linear programm (a) Fill in the initial tableau below in order to start...

    2. Consider the linear programm (a) Fill in the initial tableau below in order to start the Big-M Method tableau by performing one pivot operation. (6) The first tableau below is the tableau just before the optimal tableau, and the second one oorresponds to the optimal tableau. Fill in the missing entries for the second one. 1 7 56 M15 25 01 3/2 2 0 0 1/2 0 15/2 #310 0 5/2-1 o 1-1/2 0133/2 a1 a rhs (i) Exhibit...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT