Scribd Logo
Upload

Welcome to Scribd!

  • Sacdalan Zylle Final Activity 3

    Uploaded by

    Jamaica Moraleja
    22 views7 pages
    The document presents a linear programming problem to maximize the objective function Z subject to multiple constraints on variables A, B, and C. It provides the coefficients for the objective function and constraints, and shows the simplex method used to solve the problem by finding optimal values for the variables that satisfy all constraints and maximize Z. The solution shows the final basic feasible solution that maximizes Z at 18 with values of 2, 0.2, and 1.4 for variables A, B, and C respectively.

    Original Description:

    Original Title

    SACDALAN-ZYLLE-FINAL-ACTIVITY-3

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document presents a linear programming problem to maximize the objective function Z subject to multiple constraints on variables A, B, and C. It provides the coefficients for the objective function and constraints, and shows the simplex method used to solve the problem by finding optimal values for the variables that satisfy all constraints and maximize Z. The solution shows the final basic feasible solution that maximizes Z at 18 with values of 2, 0.2, and 1.4 for variables A, B, and C respectively.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    22 views7 pages

    Sacdalan Zylle Final Activity 3

    Uploaded by

    Jamaica Moraleja
    The document presents a linear programming problem to maximize the objective function Z subject to multiple constraints on variables A, B, and C. It provides the coefficients for the objective function and constraints, and shows the simplex method used to solve the problem by finding optimal values for the variables that satisfy all constraints and maximize Z. The solution shows the final basic feasible solution that maximizes Z at 18 with values of 2, 0.2, and 1.4 for variables A, B, and C respectively.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 7

    Maximize: Z = 13A+14B+13C Z = -13A-14B-13C = 0

    Constraint
    5A+10B+15C ≤ 80 5A+10B+15C+S1 = 80
    2A+8B+5C ≤ 60 2A+8B+5C+S2 = 60
    9A+6B+10C ≤ 90 9A+6B+10C+S3 = 90
    A, B, C, ≤ 0

    a b c s1 s2 s3 z
    r1 5 10 15 1 0 0 0
    r2 2 8 5 0 1 0 0
    r3 9 6 10 0 0 1 0
    r4 13 -14 -13 0 0 0 1

    a b c s1 s2 s3 z
    r1 5over2 0 35/4 1 (-5)over4 0 0
    r2 1over4 1 5over8 0 1over8 0 0
    r3 15over2 0 25/4 0 (-3)over4 1 0
    r4 (-19)over2 0 (-17)over4 0 7over 0 1

    a b c s1 s2 s3 z
    r1 1 0 7over2 2over5 (-1)over2 0 0
    r2 0 1 (-1)over4 (-1)over10 1over4 0 0
    r3 0 0 -20 -3 3 1 0
    r4 0 0 29 19over5 3 0 1

    a b c s1 s2 s3 z
    r1 1 0 1over6 (-1)over10 0 1over6 0
    r2 0 1 17over12 3over20 0 (-1)over12 0
    r3 0 0 (-20)over3 -1 1 1over3 0
    r4 0 0 9 4over5 0 1 1

    z a b c s1 s2 s3
    154 7 4.5 0 0 10 0
    hrs ratio
    80 8
    60 7.5
    90 15
    0

    hrs ratio
    5 2
    15over2 30
    45 6
    105

    hrs ratio
    2 -4
    7 28
    30 (-3)over5
    124

    hrs ratio
    7
    9over2
    10
    154
    Minimize  z = 8A + 4B + 6C z - 8A -4B- 6C- 100A1 - 100A2 - 100A3=0
    Constraints:
    3A + 2B + C ≥ 6 3A + 2B + C - S1 +A1 =6
    4A + B + 3C ≥ 7 4A + B + 3C -S2+A2= 7
    2A + B + 4C ≥ 8 2A + B + 4C -S2+A3= 8
    A,B,C≥0

    z a b c s1 s2 s3
    z 1 (-8) (-4) (-6) 0 0 0
    r1 0 3 2 0 -1 0 0
    r2 0 4 1 3 0 -1 0
    r3 0 2 1 4 0 0 -1

    z a b c s1 s2 s3
    z 1 892 396 794 -100 -100 -100
    r1 0 3 2 0 -1 0 0
    r2 0 4 1 3 0 -1 0
    r3 0 2 1 4 0 0 -1

    z a b c s1 s2 s3
    z 1 0 173 125 -100 123 -100
    r1 0 0 1.25 -1.25 -1 0.75 0
    r2 0 1 0.25 0.75 0 0.5 0
    r3 0 0 0.5 25 0 0.5 -1

    z a b c s1 s2 s3
    z 1 0 0 248 38.4 19.2 -100
    r1 0 0 1 -1 -0.8 0.6 0
    r2 0 1 0 1 0.2 -0.4 0
    r3 0 0 0 3 0.4 0.2 -1

    Z a b c s1 s2 s3
    z 1 0 0 0 -1.234 -0.298 -1.66
    r1 0 0 1 0 0.667 0.667 -0.33
    r2 0 1 0 0 0.067 -0.467 0.33
    r3 0 0 0 1 0.133 0.067 -0.33

    Z a b c s1 s2 s3
    18 2 0.2 1.4 0 0 0
    a1 a2 a3 rhs ratio
    -100 -100 -100 0
    1 0 0 6
    0 1 0 7
    0 0 1 8

    a1 a2 a3 rhs ratio
    0 0 0 0
    1 0 0 6
    0 1 0 7
    0 0 1 8

    a1 a2 a3 rhs ratio
    0 -223 0 539
    1 -0.75 0 0.75 0.6
    0 0.25 0 1.75 7
    0 0.5 1 4.5 9

    a1 a2 a3 rhs ratio
    -138.4 -119.2 0 453.2
    0.8 -0.6 0 0.6 -0.6
    -0.2 0.4 0 1.6 1.6
    -0.4 -0.2 1 4.2 1.2

    a1 a2 a3 rhs ratio
    -98.766 -99.234 -98.34 18
    0.667 -0.667 1.33 2
    -0.667 0.467 -0.33 0.2
    -0.33 -0.067 0.33 1.4

    a1 a2 a3
    0 0 0

    You might also like