Question

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

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

therefore, there are two constraints and 3 variables in dual probkem.

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
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: 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
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
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program....
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 23x2 s.t. 3x1 + 1.7x2 ≤ 410 1.1x1 + 3x2 ≤ 260 1x1 + 1x2 ≤ 145 x1, x2 ≥ 0 and x2 integer This is a  linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is: Max x1 + x2 s.t. x1 +...
Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a...
Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 25x2 s.t. 3x1 + 1.5x2 ≤ 400 1.5x1 + 2x2 ≤ 250 1x1 + 1x2 ≤ 150 x1, x2 ≥ 0 and x2 integer This is a mixed-integer linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is Max x1...
5.8 Explain how the following conditions can be represented as linear constraints using binary variables. (a)...
5.8 Explain how the following conditions can be represented as linear constraints using binary variables. (a) Either x1 + x2 ? 3 or 3x1 + 4x2 ? 10 (b) Variable x2 can assume values 0, 4, 7, 10, and 12 only (c) If x2 ? 3, then x3 ? 6; Otherwise x3 ? 4 (assume x2 and x3 are integers) (d) At least 2 out of the following 5 constraints must be satisfied: x1 + x2 <=7 x1 ? x2...
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...
When an LP objective function is to maximize profits: Select one: a. resource constraints must be...
When an LP objective function is to maximize profits: Select one: a. resource constraints must be of the £ variety. b. resource constraints must be of the ³ variety. c. all input costs must be variable. d. the total revenue function must not be linear. When some capacity constraints are binding, although others are nonbinding: Select one: a. the shadow price for new capacity is positive. b. the shadow price for output is positive. c. the marginal revenue product 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...
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...
Solve the linear systems that abides by the following rules. Show all steps. I. The first...
Solve the linear systems that abides by the following rules. Show all steps. I. The first nonzero coefficient in each equation is one. II. If an unknown is the first unknown with a nonzero coefficient in some equation, then that unknown doesn't appear in other equations. II. The first unknown to appear in any equation has a larger subscript than the first unknown in any preceding equation. a. x1 + 2x2 - 3x3 + x4 = 1. -x1 - x2...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT