Question

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 axis at X2 = 17?
A. Z = 2X1 + 3X2
B. 4X1 + 9X2 ≤ 72
C. 10X1 + 11X2 ≤ 110
D. 17X1 + 9X2 ≤ 153
E. X1 , X2 ≥ 0

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

The details of the solution is atach images given bleow.

1

2 Graph

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
The following is the mathematical model of a linear programming problem for profit: Maximize subject to...
The following is the mathematical model of a linear programming problem for profit: Maximize subject to Z = 2X1 + 3X2 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. Use this information for questions 19 through 23. A). Which of the following gives...
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.
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 +...
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 + X2 ≤ 4 Constraint A X1 - X2 ≤ 1 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Z - X1...
** 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.
a. Solve the following linear programming model by using the graphical method: graph the constraints and...
a. Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region then determine the optimal solution (s) (show your work). Minimize Z = 3x1 + 7x2 Subject to 9x1 + 3x2 ≥ 36 4x1 + 5x2 ≥ 40 x1 – x2 ≤ 0 2x1 ≤ 13 x1, x2 ≥ 0 b. Are any constraints binding? If so, which one (s)?
Solve the following linear programming model graphically and explain the solution result. Maximize Z = 60x1...
Solve the following linear programming model graphically and explain the solution result. Maximize Z = 60x1 + 90x2 Subject to 60x1 + 30x2 <= 1500 100x1 + 100x2 >= 6000 x2 >= 30 x1, x2 >= 0
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region. Using the corner points method, determine the optimal solution (s) (show your work). Maximize Z = 6.5x1 + 10x2 Subject to x1 + x2 ≤ 15 2x1 + 4x2 ≤ 40 x1 ≥ 8 x1, x2 ≥ 0 b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect does this have on the optimal solution? Are...
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 Solve the problem graphically in a free hand manner and identify all the CPFs. Use hand calculation to solve the problem by the simplex method in algebraic form Additional: What can you say about the solution if the RHS of the second constraint was 16? (i. e....
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...
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.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT