Question

Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤...

Solve The LP problem using the graphic method

Z Max=15X1+10X2

Constaint function:


3X1 + 2X2 ≤ 80
2X1 + 3X2 ≤ 70
X1≥ 0 , X2≥0

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 LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤...
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤ 80 5X1 + 2X2 ≤ 80 X1≥ 0 , X2≥0
Solve The LP problem using the graphic method Z Max=6X1+5X2 Constaint function: X1 + 2X2 ≤...
Solve The LP problem using the graphic method Z Max=6X1+5X2 Constaint function: X1 + 2X2 ≤ 240 3X1 + 2X2 ≤ 300 X1≥ 0 , X2≥0
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
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...
max = x1+3x2 subject to 2x1-2x2<=4 x1-2x2<=2 3x1+2x2>=6 x1 >=0 x2 unrestricted
max = x1+3x2 subject to 2x1-2x2<=4 x1-2x2<=2 3x1+2x2>=6 x1 >=0 x2 unrestricted
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 What is the optimal solution of this LP? (0,8)(12,0)(4,0)(0,4)(2,3)(0,6)(3,2) I NEED SOLUTION!
Max Z   = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2...
Max Z   = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2 + 5x3 ≤ 12 3x1 + x2 + 4x3   ≤15 and x1,x2,x3≥0; Verify that your primal and dual solutions are indeed optimal using the Complementary Slackness theorem.
Duality Theory: Consider the following LP: max 2x1+2x2+4x3 x1−2x2+2x3≤−1 3x1−2x2+4x3≤−3 x1,x2,x3≤0 Formulate a dual of this...
Duality Theory: Consider the following LP: max 2x1+2x2+4x3 x1−2x2+2x3≤−1 3x1−2x2+4x3≤−3 x1,x2,x3≤0 Formulate a dual of this linear program. Select all the correct objective function and constraints 1. min −y1−3y2 2. min −y1−3y2 3. y1+3y2≤2 4. −2y1−2y2≤2 5. 2y1+4y2≤4 6. y1,y2≤0
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)
Solve the following LP problem graphically using level curves. MAX: 7 X1 + 4 X2 Subject...
Solve the following LP problem graphically using level curves. MAX: 7 X1 + 4 X2 Subject to: 2X1 + X2 ≤ 16 X1 + X2 ≤ 10 2X1 + 5 X2 ≤ 40 X1, X2 ≥ 0 a. X1 = 4 b. X1 = 6 c. X1 = 8 d. X1 = 10
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT