Question

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

Homework Answers

Answer #1

Given data:

Objective function:

Max, Z=6X1+5X2

Constaint

X1 + 2X2 ≤ 240 ----------(1st constraint)
3X1 + 2X2 ≤ 300  ----------(2nd constraint)
X1≥ 0 , X2≥0

X1 intercepts in ghraph.

X1 = 240 in first constraint

X1 = 100 in second constraint

X2 intercepts in graphs.

X2 = 120 in 1st constraint

X2 =150 in second constraints

then the graph will be

the shaded area is the constraint satisfied area.

point A = (0,120)

point B =(30,105)

point C = (100,0)

These are the boundary points one of this point will give the maximum value.

Z= 6X1+5X2

Z(A) =(6*0)+5*120 = 600

Z(B) = 6*30 +5*105 =705

Z(C) = 6*100+ 5*0 = 600

So we are getting maximum value 705. at B point .

so the answer is

X1 =30

X2 = 105,

Max Z = 705.

Know the answer?
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
Similar Questions
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
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
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...
Solve the linear programs using the simplex tableau. Max               Z = -6X1 - 14X2 - 13X3...
Solve the linear programs using the simplex tableau. Max               Z = -6X1 - 14X2 - 13X3 Subject to      X1 + 4X2 + 2X3 ≤ 48                       X1 + 2X2 + 4X3 ≤ 60                       X1, X2, X3 ≥ 0
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual...
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual model b.) Given the information that the optimal basic variables are X1 and X3, determine the associated optimal dual 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
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 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
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
what is the dual problem? MAX 100X1+120X2+150X3+125X4 S.T. 1) X1 + 2X2 + 2X3 + 2X4...
what is the dual problem? MAX 100X1+120X2+150X3+125X4 S.T. 1) X1 + 2X2 + 2X3 + 2X4 ≤ 108 2) 3X1 + 5X2 + X4 ≤ 120 3) X1 + X3 ≤ 25 4) X2 + X3 + X4 ≥ 50 X1,X2,X3,X4≥0