Scribd Logo
Upload

Welcome to Scribd!

  • Activity in Operation Research Module 3

    Uploaded by

    Janet Graviles
    4 views3 pages
    The document contains 3 linear programming problems with multiple constraints and variables to minimize or maximize an objective function. The first problem involves minimizing a function subject to 3 constraints and solving for the basic feasible solution. The second problem uses a simplex tableau to maximize a function subject to 3 constraints. The third problem involves dealing with degeneracy when minimizing a function subject to 3 constraints.

    Original Description:

    Operation research

    Original Title

    activity-in-Operation-research-module-3

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains 3 linear programming problems with multiple constraints and variables to minimize or maximize an objective function. The first problem involves minimizing a function subject to 3 constraints and solving for the basic feasible solution. The second problem uses a simplex tableau to maximize a function subject to 3 constraints. The third problem involves dealing with degeneracy when minimizing a function subject to 3 constraints.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views3 pages

    Activity in Operation Research Module 3

    Uploaded by

    Janet Graviles
    The document contains 3 linear programming problems with multiple constraints and variables to minimize or maximize an objective function. The first problem involves minimizing a function subject to 3 constraints and solving for the basic feasible solution. The second problem uses a simplex tableau to maximize a function subject to 3 constraints. The third problem involves dealing with degeneracy when minimizing a function subject to 3 constraints.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Activity 3

    Answer the following LP.

    1). Minimize −2 x1 +3 x 2+ x3 + x 4 +6 x 5=z (*)

    Subject to:

    −6 x 1+ 8 x2 + x 4 −6 x 5=13 (1)

    4 x1 +2 x 2+ x 3−x 4 + 9 x5 =21 (2)

    x1, … , x5 ≥ 0

    Answer:

    −2 x1 +3 x 2+ x3 + x 4 +6 x 5=z

    −( 4 x 1 +2 x 2 + x 3−x 4 +9 x 5=21)
    −6 x 1+ x2 +2 x 4−3 x 5=z−21 (1’)

    −6 x 1+ x2 +2 x 4−3 x 5=z−21 −(−6 x 1+8 x 2 + x 4−6 x 5=13)

    −7 x 2+ x 4 +3 x 5 =z−34

    −6 x 1+ 8 x2 + x 4 −6 x 5=13

    4 x1 +2 x 2+ x 3−x 4 + 9 x5 =21

    −7 x 2+ x 4 +3 x 5 =z−34

    Set x 1∧x 2=0

    x 4 −6 x5 =13 x 3+ 9 x5 =21

    x 4 =13+6 x 5 x 3=21−9 x 5

    13 21
    x5 ≤ x5≤
    6 9
    13
    x5≤ , x =0 , x 3=21
    6 4
    13
    Basic solution (0,0,21,0 , ), where z=34−21=13
    6

    2). Use simplex Tableau


    Maximize 2 x1 +3 x 2+ 4 x 3 subject to x 1 , x 2 , x 3 ≥ 0 and

    5 x 1+3 x 2 +7 x3 ≤ 70

    −3 x 1+3 x 2 +2 x 3 ≤ 40

    6 x 1−x 2+ x3 ≤ 30

    Answer:

    Minimize −2 x1 −3 x 2−4 x 3 subject to x 1 , x 2 , x 3 , x 4 , x 5 , x 6 ≥ 0 and

    5 x 1+3 x 2 +7 x3 + x 4 =70

    −3 x 1+3 x 2 +2 x 3 + x 5=40

    6 x 1−x 2+ x3 + x 6=30

    x1 x2 x3 x4 x5 x6
    x4 5 3 7 1 0 0 70
    x5 -3 3 2 0 1 0 40
    x6 6 -1 1 0 0 1 30
    -2 -3 -4 0 0 0 0
    x4 -37 10 0 1 0 0 -140
    x5 -15 5 0 0 1 0 -20
    x6 6 -1 1 0 0 1 30
    22 -7 0 0 0 0 120
    x4 -7 0 0 1 -2 0 -100
    x5 -3 1 0 0 1/5 0 -4
    x6 3 0 1 0 1/5 1 26
    1 0 0 0 7/5 0 92
    x4 1 0 0 -1/7 2/7 0 100/7
    x5 0 1 0 3/7 37/35 0 300/7
    x6 0 0 1 -6/7 -23/35 1 -118/7
    0 0 0 -2/7 39/35 0 544/7

    −544 100 300 118 118


    z min = attained at ( , ,− , 0,0 ,− )
    7 7 7 7 7

    3). Degeneracy
    Minimize 3 x 1+2 x 2+ 6 x3 + x 4 =z subject to x 1 , x 2 , x 3 , x 4 ≥ 0 and

    6 x 1−2 x2 +7 x 3−x 4 ≥ 50

    2 x1 +3 x 2+ 2 x 4 ≥ 9 0

    3 x 1−x 2+ x 3 + x 4 ≥1 30

    Answer

    6 x 1−2 x2 +7 x 3−x 4 + x 5=50

    2 x1 +3 x 2+ 2 x 4 + x 6=90

    3 x 1−x 2+ x 3 + x 4 + x 7=130

    3 x 1+2 x 2+ 6 x3 + x 4 =z+ 0

    x1 x2 x3 x4 x5 x6 x7
    x5 6 -2 7 -1 1 0 0 50
    x6 2 3 0 2 0 1 0 90
    x7 3 -1 1 1 0 0 1 130
    3 2 6 1 0 0 0 0
    x5 -15 5 0 -8 1 0 -7 -860
    x6 2 3 0 2 0 1 0 90
    x7 3 -1 1 1 0 0 1 130
    -15 8 0 -5 0 0 -6 -780
    x5 -55/3 0 0 -34/3 1 -5/3 -7 -1010
    x6 2/3 1 0 2/3 0 1/3 0 30
    x7 11/3 0 1 5/3 0 1/3 1 160
    -61/3 0 0 -31/3 0 -8/3 -6 -1020
    x5 1 0 0 34/55 -3/55 5/55 21/55 606/11
    x6 0 1 0 14/55 2/55 33/97 -14/55 -74/11
    x7 0 0 1 -3/5 1/5 0 -2/5 -42
    0 0 0 123/55 -61/55 -9/11 97/55 1102/11

    −1102 606
    z min = attained at (0,0 , 0,0 , , 0,0)
    11 11

    You might also like