Question

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

Math   Statistics-And-Probability   
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
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...
Solve the following linear program using the simplex method. If the problem is two dimensional, graph...
Solve the following linear program using the simplex method. If the problem is two dimensional, graph the feasible region, and outline the progress of the algorithm. Minimize Z = 3X1 – 2X2 – X3 Subject to 4X1 + 5X2 – 2X3 ≤ 22                     X1 – 2X2 + X3 ≤ 30                     X1, X2, X3 ≥ 0
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1...
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1 + 2X2 > (or equal to) 80 3X1 + X2 > (or equal to) 75 X1, X2 > 0
solve the following model graphically: maximize 2x1 +7x2 subject to: 9x1 +7x2 ≤ 63 5x1 +8x2...
solve the following model graphically: maximize 2x1 +7x2 subject to: 9x1 +7x2 ≤ 63 5x1 +8x2 ≤ 40 9x1 −15x2 ≥ 0 x1 ≥ 3 x2 ≤ 4 x1, x2 ≥ 0 Take care to identify and label the feasible region, feasible points, optimal isovalue line and use algebra to determine the optimal solution.
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Minimize Z = 2x1 + 3x2 Subject to             4x1 + 2x2 ≥ 20             2x1 + 6x2 ≥ 18               x1 + 2x2 ≤ 12 x1, x2  ≥ 0 with solution! thak you so much :D
Using the graphical method, described in class, determine the optimal solution(s) (if they exist) for the...
Using the graphical method, described in class, determine the optimal solution(s) (if they exist) for the linear program. If no optimal exists, then indicate that and explain why no optimal solution exists. (a) Maximize : z = 2x1 + 8x2 Subject to : 3x1 ≤ 12 x1 + 4x2 ≤ 24 x1 ≥ 0 x2 ≥ 0 (b) Maximize : z = 2x1 − 3x2 Subject to : 6x1 − 3x2 ≤ −9 x1 ≤ 0 x2 ≤ 0
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 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
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...
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on the feasible region described by the...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT