Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    l 3-2 Linear Programming Special Cases v 2

    Uploaded by

    olexsufiyan

    Copyright:

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

    l 3-2 Linear Programming Special Cases v 2

    Uploaded by

    olexsufiyan
    5 views11 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    5 views11 pages

    l 3-2 Linear Programming Special Cases v 2

    Uploaded by

    olexsufiyan

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 11

    Special cases in Linear Programming

     Degeneracy
     Alternative solution
     Unbounded solution.
     Infeasible solution.
    Special cases in Linear Programming
    Some cases in solving linear programming
    are:
    1- Degeneracy
    In Graphic method
    There will be one of the constraint will have no
    effect on the solution.

    In Simplex method:
    One solution will be repeated in the solution
    table.
    Special cases in Linear Programming
    Example:
    Max Z = 3 X1 + 7 X2
    Subject to
    2 X1 + 8 X2 ≤ 16
    2 X1 + 4 X2 ≤ 8
    X1 , X2 ≥ 0
    Special cases in Linear Programming
    Solution:

    X1

    X2
    Special cases in Linear Programming

    Basic Variables X1 X2 S1 S2 Solution


    S1 2 8 1 0 16
    S2 2 4 0 1 8
    Z -3 -7 0 0 0

    Basic Variables X1 X2 S1 S2 Solution


    X2 1/4 1 1/8 0 2
    S2 1 0 -1/2 1 0
    Z -5/4 0 7/8 0 14

    Basic Variables X1 X2 S1 S2 Solution


    X2 0 1 1/4 -1/4 2
    X1 1 0 -1/2 1 0
    Z 0 0 1/4 5/4 14
    Special cases in Linear Programming
    2- Alternative solution
    In some cases we find more than one solution
    for the objective function.
    Example
    Max Z = 2 X1 + 4 X2
    Subject to
    X1 + 2 X2 ≤ 5
    X1 + X2 ≤ 4
    X1 , X2 ≥ 0
    Special cases in Linear Programming
    Solution:

    X1

    X2
    Special cases in Linear Programming
    3- Unbounded solution
    When the solution area is open.
    Example
    Max Z = 3 X1 + 2 X2
    Subject to
    X1 - X2 ≤ 2
    2 X1 + 3 X2 ≤ 6
    X1 , X2 ≥ 0
    Special cases in Linear Programming
    4- Infeasible solution
    When the solution area is bounded by oppesit
    constraint.
    Example
    Max Z = 2 X1 + 3 X2
    Subject to
    5/2 X1 - 2 X2 ≤ 5
    5 X1 + 4 X2 ≥ 6
    X1 , X2 ≥ 0
    Special cases in Linear Programming
    Solution:

    X1
    5

    5/2

    X2
    2 4
    The Dual Model
    For Each Primer Model there is a Dual Model. They can be used to
    reach to liner programing solution faster.
    For the Primer Model The Dual Model is as follows:
    below: We will have
    Min Z = 4X1 + 1X2 3 Variables.
    Subject to: 2 Constraints
    30X1 +10X2 ≥ 100 Objective Function will be
    125 X1 +12 X2 ≥ 200 change to Maximize
    120 X1 + 15 X2 ≥ 150 Max w = 100 y1 + 200 y2 + 150 y3
    X1, X2 ≥ 0 Subject to:
    30y1+ 125y2 + 120y3 ≤ 4
    We have 10y1+ 12y2 + 15y3 ≤ 1
    2 Variables.
    y1, y2 , y3 ≥ 0
    3 Constraints

    You might also like