Question

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

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
** 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.
Solve the linear programs using the simplex tableau. Max               Z = -6X1 - 14X2 - 13X3...
Solve the linear programs using the simplex tableau. Max               Z = -6X1 - 14X2 - 13X3 Subject to      X1 + 4X2 + 2X3 ≤ 48                       X1 + 2X2 + 4X3 ≤ 60                       X1, X2, X3 ≥ 0
in parts a and b use gaussian elimination to solve the systems of linear equations. show...
in parts a and b use gaussian elimination to solve the systems of linear equations. show all steps. a. x1 - 4x2 - x3 + x4 = 3 3x1 - 12 x2 - 3x4 = 12 2x1 - 8x2 + 4x3 - 10x4 = 12 b. x1 + x2 + x3 - x4 = 2 2x1 + 2x2 - 2x3 = 3 2x1 + 2x2 - x4 = 2
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)
Consider the following integer programming problem.Maximize: z=8x1 +12x2 +6x3 +4x4 Subject to constraint: 5x1 + 9x2...
Consider the following integer programming problem.Maximize: z=8x1 +12x2 +6x3 +4x4 Subject to constraint: 5x1 + 9x2 +4x3 +3x4 ≤ 16 where x1, x2, x3 and x4 are binary integers (0 or 1). By applying the Branch and Bound Algorithm find the solution.
Consider the following mixed-integer linear program. Max     3x1 + 4x2 s.t. 4x1 + 7x2 ≤ 28...
Consider the following mixed-integer linear program. Max     3x1 + 4x2 s.t. 4x1 + 7x2 ≤ 28 8x1 + 5x2 ≤ 40 x1, x2 ≥ and x1 integer (c) Find the optimal solution for the mixed-integer linear program. (Round your answers to three decimal places, when necessary.)
The following is the mathematical model of a linear programming problem for profit: Maximize Z =...
The following is the mathematical model of a linear programming problem for profit: Maximize Z = 2X1 + 3X2 subject to: 4X1 + 9X2 ≤ 72 10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153 X1 , X2 ≥ 0 The constraint lines have been graphed below along with one example profit line (dashed). The decision variable X1 is used as the X axis of the graph. Which of the following gives the constraint line that cuts the X2...
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...
Solve the linear systems that abides by the following rules. Show all steps. I. The first...
Solve the linear systems that abides by the following rules. Show all steps. I. The first nonzero coefficient in each equation is one. II. If an unknown is the first unknown with a nonzero coefficient in some equation, then that unknown doesn't appear in other equations. II. The first unknown to appear in any equation has a larger subscript than the first unknown in any preceding equation. a. x1 + 2x2 - 3x3 + x4 = 1. -x1 - x2...
2. The following linear programming problem has been solved by The Management Scientist. Use the output...
2. The following linear programming problem has been solved by The Management Scientist. Use the output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 25X1+30X2+15X3 S.T. 1) 4X1+5X2+8X3<1200 2) 9X1+15X2+3X3<1500 OPTIMAL SOLUTION Objective Function Value = 4700.000 Variable Variable Reduced Cost X1 140.000   0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint   Slack/Surplus Dual Price 1   0.000   1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES Variable   Lower Limit Current Value Upper Limit X1 19.286 25.000 45.000 X2 No Lower Limit 30.000 40.000...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT