Question

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

  1. Graph the region that satisfies the constraints.
  2. Find the optimal solution and the value of the objective function at the optimal solution.
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
max Z = 5x1+3x2+x3 s.t : 2x1+x2+x3 < 6 x1+2x2+x3 < 7 x1, x2, x3 >...
max Z = 5x1+3x2+x3 s.t : 2x1+x2+x3 < 6 x1+2x2+x3 < 7 x1, x2, x3 > 0 Solve the problem. What is the optimal value of the objective function (OF)? Decision variables? Solve the problem. What is the optimal value of the objective function (OF)? Decision variables? (20 points)
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)?
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...
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 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...
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....
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...
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 (same constraints found in problem #3) 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...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤ 50 2x + 3y ≤ 120 x ≥ 10 x, y ≥ 0 (a) Graph the constraints and determine the feasible region. (b) Find the coordinates of each corner point of the feasible region. (c) Determine the optimal solution and optimal objective function value.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT