Question

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) Solv

0 0
Add a comment Improve this question Transcribed image text
Answer #1

is Green Linear programming probleme - Max z = Quit 342 Elulb.fect to 1 +242 S4 hli + x2 = 3 x 7,0 42,0 @ (i) Treating 1st co心 2Now we check the realue of objective function - at the corner point of the feasible region. 1. At (211) Max Z= 2x2 + 3x1= 7 2- ) 18t we convert the brobleme to canonical form. iRtcom constraint is of a type, so we add a slack reanias and is an exuali2 for the 18t columnis. basis and Negative minimum y-ci is - - &t column Minimum ratio in in and now so an enters the 4 lеалоPLEASE RATE IF THIS WAS HELPFUL FOR YOU.

Add a comment
Know the answer?
Add Answer to:
4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54...
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
  • Consider the following problem Minimize Z3x+2 subject to 3+26 and 20, 20 ()Solve this problem graphically...

    Consider the following problem Minimize Z3x+2 subject to 3+26 and 20, 20 ()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. (c) Work through the simplex method step by step to solve the problem

  • [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...

  • (1 point) Use the simplex method to maximize P = 2x1 + 3x2 + x3 subject...

    (1 point) Use the simplex method to maximize P = 2x1 + 3x2 + x3 subject to -X -X1 + X2 + 4x2 + 2x2 + 10x35 10 + 6x3 9 + 10x3 S 11 X X120 x220 x3 20 P=

  • Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2,...

    Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks) Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)

  • 4.3-7. Consider the following problem. Maximize Z = 5x1 + 3x2 + 4x3, subject to 2x1 + x2 + x3<...

    4.3-7. Consider the following problem. Maximize Z = 5x1 + 3x2 + 4x3, subject to 2x1 + x2 + x3<= 20 3x1 + x2 + 2x3 <= 30 and x1 >= 0, x2 >= 0, x3 >= 0. You are given the information that the nonzero variables in the optimal solution are x2 and x3. (a) Describe how you can use this information to adapt the simplex method to solve this problem in the minimum possible number of iterations (when...

  • Problem #5 -- Consider the following linear programming problem: Maximize Z = 2x1 + 4x2 +...

    Problem #5 -- Consider the following linear programming problem: Maximize Z = 2x1 + 4x2 + 3x3 subject to: X1 + 3x2 + 2x3 S 30 best to X1 + x2 + x3 S 24 3x1 + 5x2 + 3x3 5 60 and X120, X220, X3 2 0. You are given the information that x > 0, X2 = 0, and x3 >O in the optimal solution. Using the given information and the theory of the simplex method, analyze the...

  • Solve the following using graphing techniques: a. Maximize 2x1 + 3x2 subject to the constraints, 2x1...

    Solve the following using graphing techniques: a. Maximize 2x1 + 3x2 subject to the constraints, 2x1 + 2x2 < 8,X1 + 2x25 4, and X1 > 3, x2 > 0

  • Work through the Simplex Method Step by step to slove the following problem. Maximize Z =...

    Work through the Simplex Method Step by step to slove the following problem. Maximize Z = -x1+x2+2x3, subject to... DI 44.10. Work through the simplex method step by step to solve the following problem. Maximize Z =-r1 + 12 + 2r), subject to 2x1 +4x2 + 283 s60 2x1+3x2 + x:s 50 and 11と0, 12と0, xsと0.

  • Find solution using Simplex method (BigM method) MAX Z = 5x1 + 3x2 + 2x3 +...

    Find solution using Simplex method (BigM method) MAX Z = 5x1 + 3x2 + 2x3 + 4x4 subject to 5x1 + x2 + x3 + 8x4 = 10 2x1 + 4x2 + 3x3 + 2x4 = 10 X j > 0, j=1,2,3,4 a) make the necessary row reductions to have the tableau ready for iteration 0. On this tableau identify the corresponding initial (artificial) basic feasible solution. b) Following the result obtained in (a) solve by the Simplex method, using...

  • + Use the simplex method to solve the linear programming problem. Maximize z= 2X2 + 3x2...

    + Use the simplex method to solve the linear programming problem. Maximize z= 2X2 + 3x2 subject to: 5x1 + x2 = 70 3x4 + 2x2 5 90 X1 + X2 580 X1, X220. with Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum is when X1 = and X2 (Simplify your answers.) OB. There is no maximum.

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