Question

Duality Theory: Consider the following LP (x1, x2 are your variables, all other values are constants):...

Duality Theory: Consider the following LP (x1, x2 are your variables, all other values are constants):

max ax1+bx2

cx1+dx2≤e

fx1−gx2≤h

ix1+jx2≤k

x1,x2≥0

The solution to the dual has the following values (using conventional primal-dual notation in terms of variable numbering):

y1 = 0

y2 = 3

y3 = 5

With the understanding of complementary slackness, what all are constraints of the original, primal problem which we know must be tight?

1. Constraint 1

2. Constraint 2

3. Constraint 3

Homework Answers

Answer #1

Solution :

By complimentary slackness theoram.

product of dual variable and slack value of primal constraints are 0 ....

this means If a dual variable non zero then their corresponding slack variable of primal constrains must be zero .. so that primal constraints shows equality (active constraints ) ..

given that y2 = 3 and y3 = 5 .... so, this gives us S2 = 0 and S3=0.

And other constraints 2 and 3 are shows equality.. so these two are tight

Answer = constraints 2 and 3

Let me know in the comment section if anything is not clear. I will reply ASAP!
If you liked the answer, please give a thumbs-up. This will be quite encouraging for me.Thank-you!

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
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
Duality Theory: What are all the correct objective function and constraints? Choose all that apply and...
Duality Theory: What are all the correct objective function and constraints? Choose all that apply and consider the following LP: max 4x1+x2 x1+2x2=6 x1−x2≥3 2x1+x2≤10 x1,x2≥0 Now formulate a dual of this linear program. Select all of the coefficients that appear in the objective function of the dual 1. 6 2. 2 3. 3 4. 10 5. 1 6. -1 7. 4
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 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...
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...
Consider the following LP Min Z = 4X1+X2 s.t. 3X1+X2=3 4X1+3X2>=6 X1+X2<=4 X1 , X2 >=...
Consider the following LP Min Z = 4X1+X2 s.t. 3X1+X2=3 4X1+3X2>=6 X1+X2<=4 X1 , X2 >= 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
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT