Question

Maximize 12X1 + 10X2 + 8X3             Total Profit Subject to      X1 + X2 + X3 >...

Maximize 12X1 + 10X2 + 8X3             Total Profit

Subject to      X1 + X2 + X3 > 160        At least a total of 160 units of all three products needed

                 X1 + 3X2 + 2X3 ≤ 450         Resource 1

                 2X1 + X2 + 2X3 ≤ 300         Resource 2

               2X1 + 2X2 + 3X3 ≤ 400         Resource 3

                  And X1, X2, X3 ≥ 0

Where X1, X2, and X3 represent the number of units of Product 1, Product 2, and Product 3 to be manufactured.

The QM for Windows output for this problem is given below.

Solution List:

Variable           Status   Value

X1       Basic    100

X2       Basic    100

X3       NONBasic       0

surplus 1          Basic    40

slack 2 Basic    50

slack 3 NONBasic       0

slack 4 NONBasic       0

Optimal Value (Z)        2200

Linear Programming Results:

X1       X2       X3                  RHS     Dual

Maximize         12        10        8                                 

Constraint 1     1          1          1          >=        160      0

Constraint 2     1          3          2          <=        450      0

Constraint 3     2          1          2          <=        300      2

Constraint 4     2          2          3          <=        400      4

Solution           100      100      0                      2200   

Ranging Results:

Variable           Value   Reduced Cost   Original Val     Lower Bound   Upper Bound

X1 100      0 12 10        20

X2 100 0 10 6          12

X3 0          8 8 -Infinity           16

            Dual Value       Slack/Surplus   Original Val     Lower Bound   Upper Bound

Constraint 1     0 40 160      -Infinity 200

Constraint 2     0 50 450 400 Infinity

Constraint 3     2 0 300 275 400

Constraint 4     4 0 400 320 420

(a) Determine the optimal solution and the optimal value and interpret their meanings.

(b) Determine the slack (or surplus) value for each constraint and interpret its meaning.

Homework Answers

Answer #1

(a) Optimal solution can be read from the Ranging results.

X1 = 100

X2 = 100

X3 = 0

Optimal value = 12*100+10*100+8*0 = 2200

Interpretation: 100 units of product 1 and 2 each should be produced. this will give a total profit of $ 2200

b)

Surplus value for constraint 1 = 40

Slack value for constraint 2 = 50

Slack for constraint 3 and 4 = 0 each

Interpretation : Surplus value of constraint 1 means that 40 units more than required are produced

Slack value of constraint 2 indicates that 50 less units of resource 1 are used, than the maximum units available.

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.
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1...
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1 - x2 + 3x3 ≤   4             2x1 + x2           ≤ 10             x1 - x2 -    x3 ≤   7 and       x1 ≥ 0,   x2 ≥ 0,    x3 ≥ 0. Use Excel Solver to solve this problem. Write out the augmented form of this problem by introducing slack variables. Work through the simplex method step by step in tabular form to solve the problem.
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...
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)
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3=...
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3= 1 2X1+ X2≤3 X2, X3 ≥0, X1 urs a) Find the standard form of the LP problem. b) Find the starting tableau to solve the Primal LP problem by using the M-Technique.
Consider the following linear programming problem: Maximize 40 X1 + 30 X2 + 60X3 Subject to:...
Consider the following linear programming problem: Maximize 40 X1 + 30 X2 + 60X3 Subject to: X1 + X2 + X3 ≥ 90 12 X1 + 8 X2 + 10 X3 ≤ 1500 X1 = 20 X3 ≤ 100 X1 , X2 , X3 ≥ 0 How many slack, surplus, and artificial variables would be necessary if the simplex algorithm were used to solve this problem?
by hand, solve the system of equations- LU Factorization -3x1+x2+x3=-2 x1+x2-x3=1 2x1+x2-2x3=1
by hand, solve the system of equations- LU Factorization -3x1+x2+x3=-2 x1+x2-x3=1 2x1+x2-2x3=1
Find the dual of the following LP, using direct method. minz=4X1 +2X2 -X3 subject to X1...
Find the dual of the following LP, using direct method. minz=4X1 +2X2 -X3 subject to X1 +2X2 ≤6 X1 -X2 +2X3 =8 X1 ≥0,X2 ≥0,X3 urs
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
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...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT