Question

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)

Homework Answers

Answer #1

Therefore the optimal solution of the objective function is Max Z = 49/3

At X​​​​​​1=5/3. And. X​​​​​​2=8/3

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
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 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...
Max Z = X1 - X2 + 3X3 s.t. X1+X3 = 5 X1+X2 <= 20 X2+X3...
Max Z = X1 - X2 + 3X3 s.t. X1+X3 = 5 X1+X2 <= 20 X2+X3 >= 10 X1 , X2 , X3 >= 0 a) Put the problem into standard form, using slack, excess, and artificial variables. b) Identify the initial BV and NBV along with their values. c) Modify the objective function using an M, a large positive number. d) Apply the Big M method to find the optimal 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.
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2...
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2 ≥ 10 x1 – x2 = 4 0.5x1 + 2x2 ≤ 20 x1 ≥ 0, x2 unconstrained Please provide an excel solution to this problem
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
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.
Consider the following linear program Max 5x1+5x2+3x3 St x1+3x2+x3<=3 -x1+ 3x3<=2 2x1-x2 +2x3<=4 2x1+3x2-x3<=2 xi>=0 for...
Consider the following linear program Max 5x1+5x2+3x3 St x1+3x2+x3<=3 -x1+ 3x3<=2 2x1-x2 +2x3<=4 2x1+3x2-x3<=2 xi>=0 for i=1,2,3 Suppose that while solving this problem with Simplex method, you arrive at the following table: z x1 x2 x3 x4 x5 x6 x7 rhs Row0 1 0 -29/6 0 0 0 11/6 2/3 26/3 Row1 0 0 -4/3 1 0 0 1/3 -1/3 2/3 Row2 0 1 5/6 0 0 0 1/6 1/3 4/3 Row3 0 0 7/2 0 1 0 -1/2 0...
Find the duals of the following LP: max z = 4x1 - x2 + 2x3 s.t....
Find the duals of the following LP: max z = 4x1 - x2 + 2x3 s.t. x1 + x2 <= 5 2x1 + x2 <= 7 2x2 + x3 >= 6 x1 + x3 = 4 x1 >=0, x2, x3 urs show steps