Question

QUESTION 1 Given the following LP, answer questions 1-10 Minimize -3x15x2 Subject to: 3x2x 24 2x1+4x2 2 28 2s 6 x1, x2 20 How

QUESTION 3 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2 228 X1.x22 0 What is

QUESTION 1 Given the following LP, answer questions 1-10 Minimize -3x15x2 Subject to: 3x2x 24 2x1+4x2 2 28 2s 6 x1, x2 20 How many extreme points exist in the feasible region for this problem? We cannot tell from the information that is provided The feasible e region is unbounded QUESTION 2 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2228 t is the optimal solution? (2, 6) (0, 12) (5,4.5) None of the above
QUESTION 3 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2 228 X1.x22 0 What is the cost minimizing value associated with the optimal solution (what is Zmin)? $30 $35 $36 $37.5 None of the above QUESTION 4 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2 28 X1.x2 0 What is the value of the extreme point at the intersection of constraints #1 and #2? (5.5, 4.5) (4.5, 5.5) (4, 5) (5, 4) None of the above
0 0
Add a comment Improve this question Transcribed image text
Answer #1

12 R尘 (5145) a330

Add a comment
Know the answer?
Add Answer to:
QUESTION 1 Given the following LP, answer questions 1-10 Minimize -3x15x2 Subject to: 3x2x 24 2x1+4x2 2 28 2s 6 x1, x2...
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
  • Linear programming question minimize 2x1 + 322 + 423, subject to 3x1-4x2-5x3 2 6, x1 +x2...

    Linear programming question minimize 2x1 + 322 + 423, subject to 3x1-4x2-5x3 2 6, x1 +x2 +x3 = 10 Eliminate the equality constraint by replacing r in terms of ri, 22, and convert it into an equivalent LP with only inequality constraints. Then find a minimizer(エ4,2 for this LP.

  • 9. Minimize x1 + x2 - X3, subject to 2x1 - 4x2 + x3 + x4...

    9. Minimize x1 + x2 - X3, subject to 2x1 - 4x2 + x3 + x4 3xı + 5x2 + x3 +xs =2. Which of x1, x2, X3 should enter the basis, and which of x4, X5 should leave? Compute the new pair of basic variables, and find the cost at the new corner.

  • QUESTION 15 Describe the solution space for the following LP model: Maximize: 2x1 3x2 Subject to:...

    QUESTION 15 Describe the solution space for the following LP model: Maximize: 2x1 3x2 Subject to: 1: 2x1 3x2 2 18 2: 4x1 2x2 2 10 x1, x2 20 Multiple optimal solutions O Infeasible None of the above QUESTION 16 Describe the solution for the folowing LP model: Maximize: 2x1 3x2 Subject to: 1:4x1 +5x2 2 20 2: 3x1 2x2 212 x1, x2 20 A single optimal solution O Infeasible Multiple optimal solutions None of the above QUESTION 17 In...

  • Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤...

    Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤ 12 2x1 + 3 x2 = 12 2 x1 + x2 ≥ 8 x1≥ 0, x2 ≥ 0 A) What is the optimal solution of this LP? Give an explanation. (4,0) (2,3) (0,8) (0,4) (0,6) (3,2) (12,0) B)Which of the following statements are correct for a linear programming which is feasible and not unbounded? 1)All of the above. 2)Only extreme points may be optimal....

  • Consider the following Linear Problem Minimize 2x1 + 2x2 equation (1) subject to: x1 + x2...

    Consider the following Linear Problem Minimize 2x1 + 2x2 equation (1) subject to: x1 + x2 >= 6 equation (2) x1 - 2x2 >= -18 equation (3) x1>= 0 equation (4) x2 >= 0 equation (5) 13. What is the feasible region for Constraint number 1, Please consider the Non-negativity constraints. 14. What is the feasible region for Constraint number 2, Please consider the Non-negativity constraints. 15. Illustrate (draw) contraint 1 and 2 in a same graph and find interception...

  • 8. Minimize z - 8x1 + 6x2 + 11x3 subject to 5x1 x2 + 3x3 s 4 5x1 + x2 + 3x3 2 2 2x, + 4x2 + 7x3 s...

    8. Minimize z - 8x1 + 6x2 + 11x3 subject to 5x1 x2 + 3x3 s 4 5x1 + x2 + 3x3 2 2 2x, + 4x2 + 7x3 s.5 2x1 + 4x2 + 7x3 2 3 X1 + X2 + X3 = 1 (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and...

  • Consider the following LP z= 2x1-x2 st s r 22 0 1. Prove the feasible region of the above LP is c...

    Consider the following LP z= 2x1-x2 st s r 22 0 1. Prove the feasible region of the above LP is convex set. (Note: You could not prove using graphical representation) (2 points) 2. Find extreme directions of the feasible region. (2 points) Consider the following LP z= 2x1-x2 st s r 22 0 1. Prove the feasible region of the above LP is convex set. (Note: You could not prove using graphical representation) (2 points) 2. Find extreme directions...

  • Problem A: Consider the following LP problem to answer Questions 4 and 5. Maximise z =...

    Problem A: Consider the following LP problem to answer Questions 4 and 5. Maximise z = 5x1 + 4x2 Subject to 6X1 + 4x2 < 24 X1 + 2x2 5 6 -X1 + x2 <1 X2 < 2 X1, X2 > 0 Question 4 Refer to Problem A: Which of the following statements is correct? (1) The optimal value of x1 is in the interval [10, 15). (2) The optimal valu X2 is in the rval [0, 5). (3) The...

  • Consider the following LP problem. MAX: 9X1-8X2 Subject to: x1+x2≤6 -x1+x2≤3 3x1-6x2≤4 x1,x2≥0 Sketch the feasible...

    Consider the following LP problem. MAX: 9X1-8X2 Subject to: x1+x2≤6 -x1+x2≤3 3x1-6x2≤4 x1,x2≥0 Sketch the feasible region for this model. What is the optimal solution? What is the optimal solution if the objective function changes to Max.-9x1+8x2?

  • Question 3: Identify which of LP problems (1)--(4) has (x1,x2) = (20,60) as its optimal solution....

    Question 3: Identify which of LP problems (1)--(4) has (x1,x2) = (20,60) as its optimal solution. (1) min z = 50xı + 100X2 s.t. 7x1 + 2x2 > 28 2x1 + 12x2 > 24 X1, X2 > 0 (2) max z = 3x1 + 2x2 s.t. 2x1 + x2 < 100 X1 + x2 < 80 X1 <40 X1, X2 > 0 (3) min z = 3x1 + 5x2 s.t. 3x1 + 2x2 > 36 3x1 + 5x2 > 45...

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