Question

Consider the following program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c=...

  1. Consider the following program

Min Z=-x1-x2

s.t

2x1+x2≤10

-x1+2x2≤10

X1, x2≥0

Suppose that the vector c= {-1,-1} is replaced by (-1,-1) +ʎ (2, 3) where ʎ is a real number

Find optimal solutions for all values of ʎ

     Z

    X1

     X2

    S1

  S2

   RhS

    Z

     1

     0

      0

   -0.6

   -0.2

    -8

   X1

     0

     1

      0

    0.4

   -0.2

    10

   X2

     0

     0

      1

    0.2

    0.4

    10

Homework Answers

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 program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c=...
Consider the following program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c= {-1,-1} is replaced by (-1,-1) +ʎ (2, 3) where ʎ is a real number Find optimal solutions for all values of ʎ      Z     X1      X2     S1     S2    RhS     Z      1      0       0    -0.6    -0.2     -8    X1      0      1       0     0.4    -0.2      2    X2...
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.
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)
Minimize Z = X1+2X2 Subject to -X1+X2 ? 15 2X1+X2 ? 90 X2 ? 30 And...
Minimize Z = X1+2X2 Subject to -X1+X2 ? 15 2X1+X2 ? 90 X2 ? 30 And X1 ? 0, X2 ? 0 a.) Solve this graphically b.) Develop a table giving each of the CPF solutions and the corresponding defining equations, BF solutions, and non-basic variables.
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 LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤...
Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤ 12 2x1 + 3 x2 = 12 2 x1 + x2 ≥ 8 x1≥ 0, x2 ≥ 0 What is the optimal solution of this LP? (0,8)(12,0)(4,0)(0,4)(2,3)(0,6)(3,2) I NEED SOLUTION!
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
Consider this problem and answer the following questions. Maximize      Z = 2x1 + 3x2           s.t....
Consider this problem and answer the following questions. Maximize      Z = 2x1 + 3x2           s.t.                                x1   +   2x2 <= 30                                x1    +    x2   <= 20                                x1,          x2   >= 0 Solve the problem graphically in a free hand manner and identify all the CPFs. Use hand calculation to solve the problem by the simplex method in algebraic form Additional: What can you say about the solution if the RHS of the second constraint was 16? (i. e....
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 +...
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 + 8x2 ≤ 12 (N) x1 ≥ 0, x2 ≥ 0 and the following possible market equilibria: i) x1 = 0, x2 = 3/2, pK = 0, pN = 1/4, ii) x1 = 1, x2 = 2, pK = 2, pN = 1, iii) x1 = 1, x2 = 2, pK = 4, pN = 0, iv) x1 = 5, x2 = 0, pK =...
Solve the LPP below by making use of the dual simplex method. min z=2x1+3x2+4x3 st: x1+2x2+x3>=3...
Solve the LPP below by making use of the dual simplex method. min z=2x1+3x2+4x3 st: x1+2x2+x3>=3    2x1-x2+3x3>=4    x1,x2,x3>=0