Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    Sheet 6 PDF

    Uploaded by

    Iniyan I T
    The document provides 8 problems related to linear programming problems (LPP). Problem 1 provides an LPP and asks to form the optimal table given information about the optimal basis and inverse of the optimal basis. Problem 2 asks to solve problem 1 with two different objective functions. Problem 3 adds a variable to problem 1 and asks to solve for two different profits. Problem 4 provides another LPP and asks to solve it using the big M method. Problem 5 asks sensitivity analysis questions related to problem 4. Problems 6 and 7 ask about parameter changes to problem 4. Problem 8 provides another LPP and asks sensitivity analysis questions. Problems 9 and 10 provide additional LPPs and ask related questions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Sheet 6 PDF

    Uploaded by

    Iniyan I T
    33 views2 pages
    The document provides 8 problems related to linear programming problems (LPP). Problem 1 provides an LPP and asks to form the optimal table given information about the optimal basis and inverse of the optimal basis. Problem 2 asks to solve problem 1 with two different objective functions. Problem 3 adds a variable to problem 1 and asks to solve for two different profits. Problem 4 provides another LPP and asks to solve it using the big M method. Problem 5 asks sensitivity analysis questions related to problem 4. Problems 6 and 7 ask about parameter changes to problem 4. Problem 8 provides another LPP and asks sensitivity analysis questions. Problems 9 and 10 provide additional LPPs and ask related questions.

    Original Title

    Sheet 6.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides 8 problems related to linear programming problems (LPP). Problem 1 provides an LPP and asks to form the optimal table given information about the optimal basis and inverse of the optimal basis. Problem 2 asks to solve problem 1 with two different objective functions. Problem 3 adds a variable to problem 1 and asks to solve for two different profits. Problem 4 provides another LPP and asks to solve it using the big M method. Problem 5 asks sensitivity analysis questions related to problem 4. Problems 6 and 7 ask about parameter changes to problem 4. Problem 8 provides another LPP and asks sensitivity analysis questions. Problems 9 and 10 provide additional LPPs and ask related questions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    33 views2 pages

    Sheet 6 PDF

    Uploaded by

    Iniyan I T
    The document provides 8 problems related to linear programming problems (LPP). Problem 1 provides an LPP and asks to form the optimal table given information about the optimal basis and inverse of the optimal basis. Problem 2 asks to solve problem 1 with two different objective functions. Problem 3 adds a variable to problem 1 and asks to solve for two different profits. Problem 4 provides another LPP and asks to solve it using the big M method. Problem 5 asks sensitivity analysis questions related to problem 4. Problems 6 and 7 ask about parameter changes to problem 4. Problem 8 provides another LPP and asks sensitivity analysis questions. Problems 9 and 10 provide additional LPPs and ask related questions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Indian Institute of Technology Roorkee

    Optimization Techniques (MAN-010)

    Exercise-6

    1. Consider the LPP

    Max z = 3x1 + 2 x2 + 5 x3
    s/t x1 + 2 x2 + x3 ≤ 430, 3x1 + 2 x3 ≤ 460, x1 + 4 x2 ≤ 420, x1 , x2 , x3 ≥ 0.
    Given that x2 , x3 , x6 (slack variable corresponding to constraint 3) form the optimal basis
    and inverse of the optimal basis is, row-wise; ½, -1/4, 0; 0, ½ 0; -2, 1, 1. Form the
    optimal table based on this information.

    2. In problem 1, find the optimal solution if the objective function is changed to


    (i) z = 4 x1 + 2 x2 + x3 (ii) z = 3x2 + x3

    3. In problem 1, a fourth variable is added with the technological (constraint) coefficients as 3,


    2 and 4. Determine the optimal solution if the profit per unit of the new variable is given as 5
    and 10.

    4. Solve this problem using big M-method.


    Max z = 5 x1 + 2 x2 + 3x3 s/t x1 + 5 x2 + 3x3 = 30, x1 − 5 x2 − 6 x3 ≤ 40, all vari ≥ 0.

    5. In problem 4, find the optimal solution, using sensitivity analysis if the objective function is
    changed to
    (i) Max z = 12 x1 + 5x2 + 2 x3 (ii) Min z = 2 x2 − 5x3

    6. In problem 4, suppose that the technological coefficients of x2 are (5 − a, −5 + a) instead of


    (5, - 5), where a is a nonnegative parameter. Find the value of a so that the solution remains
    optimal.

    7. In problem 4, suppose that the right hand side of the constraint becomes (30 + a , 40 – a ),
    a is nonnegative parameter. Determine the values of a so that the solution of the problem
    remain optimal.

    8. Solve the LPP: Minimize z = -x1 + x2 + x3


    Subject to –2 x1 + x2 + x3 ≥ 2, x1 – 2 x2 + 2 x3 = 2, x1, x2, x3 ≥ 0
    by Big M method. Find the optimal solution of the changed LPP obtained from the above
    LPP by employing the following (using the concepts of sensitivity analysis):

    (a) Changing the RHS of second constraint to 8.


    (b) Add the constraint x1 + x2 + x3 ≤ 1.
    (c) The cost c1 of x1 is changed from -1 to -3.
    (d) Add the constraint x1 + x2 + x3 ≥ 4.
    (f) Add the variable x4 with cost -2 and column (2, -1)T
    10. (i) Consider the problem Max z = − x1 + 2 x2 − x3 subject to x1 + 2 x2 − 2 x3 ≤ 4 ,
    x1 − x3 ≤ 3 , 2 x1 − x2 + 2 x3 ≤ 2 , x1 , x2 , x3 ≥ 0 .
    The optimal table of the above LPP is:

    B.V x1 x2 x3 s1 s2 s3 Solution
    Z 9/2 0 0 3/2 0 1 8
    x2 3 1 0 1 0 1 6
    s2 7/2 0 0 ½ 1 1 7
    x3 5/2 0 1 ½ 0 1 4

    (a) Find the range of the cost coefficient c 2 of variable x 2 such that present solution remains
    optimal.
    (b) If the RHS of the original problem is changed to (5,4,1) then find the optimal solution.
    (c) Find the range of b2 (RHS of second constraint) so that the present solution remains
    optimal.
    (d) Find the optimal solution after adding a new constraint 3x1 − x2 ≥ 1.

    You might also like