Scribd Logo
Upload

Welcome to Scribd!

  • 4.1.1 Model Formulasi 4.1.1.1 Formulasi 1

    Uploaded by

    Indra Sapta Noegraha
    13 views4 pages
    The document describes three formulations for an optimization problem. Formulation 1 minimizes the sum of variables Xik subject to constraints involving Xik, tijk, and Xih variables. Formulation 2 is similar but with additional constraints involving Xpk, Yipk, and tpqk variables. Formulation 3 also minimizes the sum of Xik variables, but with constraints involving Xik, Xpk, Yipk, tijk, and M variables. The constraints are presented under three scenarios for different values of the Yipk variables.

    Original Description:

    model formulasi operation research

    Original Title

    Model Formulasi

    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 describes three formulations for an optimization problem. Formulation 1 minimizes the sum of variables Xik subject to constraints involving Xik, tijk, and Xih variables. Formulation 2 is similar but with additional constraints involving Xpk, Yipk, and tpqk variables. Formulation 3 also minimizes the sum of Xik variables, but with constraints involving Xik, Xpk, Yipk, tijk, and M variables. The constraints are presented under three scenarios for different values of the Yipk variables.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    13 views4 pages

    4.1.1 Model Formulasi 4.1.1.1 Formulasi 1

    Uploaded by

    Indra Sapta Noegraha
    The document describes three formulations for an optimization problem. Formulation 1 minimizes the sum of variables Xik subject to constraints involving Xik, tijk, and Xih variables. Formulation 2 is similar but with additional constraints involving Xpk, Yipk, and tpqk variables. Formulation 3 also minimizes the sum of Xik variables, but with constraints involving Xik, Xpk, Yipk, tijk, and M variables. The constraints are presented under three scenarios for different values of the Yipk variables.

    Copyright:

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

    4.1.

    1 Model Formulasi
    4.1.1.1 Formulasi 1
    Minimasi ∑𝑛=6 𝑚=4
    𝑖=1 ∑𝑘=1 𝑋𝑖𝑘

    Dengan kendala
    𝑋𝑖𝑘 + 𝑡𝑖𝑗𝑘 ≥ 𝑋𝑖ℎ untuk (i,j-i,h) << (i,j,k)
    𝑋𝑝𝑘 − 𝑋𝑖𝑘 + 𝑀(1 − 𝑌𝑖𝑝𝑘 ) ≥ 𝑡𝑝𝑞𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m
    𝑋𝑖𝑘 − 𝑋𝑝𝑘 + 𝑀𝑌𝑖𝑝𝑘 ≥ 𝑡𝑖𝑗𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    a. Fungsi Tujuan:
    Minimasi ∑𝑛=6 𝑚=4
    𝑖=1 ∑𝑘=1 𝑋𝑖𝑘

    Min Z = X11 + X12 + X13 + X14 + X21 + X22+ X23 + X24 +


    X31 + X32 + X33 + X34 + X41 + X42 + X43 + X44 +
    X51 + X52 + X53 + X54 + X61 + X62 + X63 + X64

    b. Fungsi Pembatas :
    Pembatas 1
    𝑋𝑖𝑘 + 𝑡𝑖𝑗𝑘 ≤ 𝑋𝑖ℎ untuk (i,j-1,h) << (i,j,k)

    X11+X12+X13+X14+ t11+t12+t13+t14+
    X21+X22+X23+X24+ t21+t22+t23+t24+ X23+X32+X33+
    X31+X32+X33+X34+ t31+t32+t33+t34+ X41+X42+X43+
    + ≥
    X41+X42+X43+X44+ t41+t42+t43+t44+ X51+X52+X53+
    X51+X52+X53+X54+ t51+t52+t53+t54+ X61+X62+X63
    X61+X62+X63+X64 t61+t62+t63+t64
    4.1.1.2 Formulasi 2
    Minimasi ∑𝑛=6 𝑚=4
    𝑖=1 ∑𝑘=1 𝑋𝑖𝑘

    Dengan kendala
    𝑋𝑖𝑘 + 𝑡𝑖𝑗𝑘 ≥ 𝑋𝑖ℎ untuk (i,j-i,h) << (i,j,k)
    𝑋𝑝𝑘 − 𝑋𝑖𝑘 + 𝑀(1 − 𝑌𝑖𝑝𝑘 ) ≥ 𝑡𝑝𝑞𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m
    𝑋𝑖𝑘 − 𝑋𝑝𝑘 + 𝑀𝑌𝑖𝑝𝑘 ≥ 𝑡𝑖𝑗𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    a. Fungsi Tujuan:
    Minimasi ∑𝑛=6 𝑚=4
    𝑖=1 ∑𝑘=1 𝑋𝑖𝑘

    Min Z = X11 + X12 + X13 + X14 + X21 + X22+ X23 + X24 +


    X31 + X32 + X33 + X34 + X41 + X42 + X43 + X44 +
    X51 + X52 + X53 + X54 + X61 + X62 + X63 + X64

    b. Fungsi Pembatas :
    Pembatas 2
    𝑋𝑝𝑘 − 𝑋𝑖𝑘 + 𝑀(1 − 𝑌𝑖𝑝𝑘 ) ≥ 𝑡𝑝𝑞𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m
     Skenario pembatas 2-a dengan nilai 𝑌𝑖𝑝𝑘 = 1, maka
    𝑋𝑝𝑘 − 𝑋𝑖𝑘 ≥ 𝑡𝑝𝑞𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    X11+X12+X13+X14+
    X23+X32+X33+ X21+X22+X23+X24+ t23+t32+t33+
    X41+X42+X43+ X31+X32+X33+X34+ t41+t42+t43+
    + ≥
    X51+X52+X53+ X41+X42+X43+X44+ t51+t52+t53+
    X61+X62+X63 X51+X52+X53+X54+ t61+t62+t63
    X61+X62+X63+X64
     Skenario pembatas 2-b dengan nilai 𝑌𝑖𝑝𝑘 = 0, maka
    𝑋𝑝𝑘 − 𝑋𝑖𝑘 + 𝑀(1 − 𝑌𝑖𝑝𝑘 ) ≥ 𝑡𝑝𝑞𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    X11+X12+X13+X14+
    X23+X32+X33+ X21+X22+X23+X24+ M1+M2+ t23+t32+t33+
    X41+X42+X43+ X31+X32+X33+X34+ M3+M4+ t41+t42+t43+
    + + ≥
    X51+X52+X53+ X41+X42+X43+X44+ M5+M6 t51+t52+t53+
    X61+X62+X63 X51+X52+X53+X54+ t61+t62+t63
    X61+X62+X63+X64

    4.1.1.3 Formulasi 3
    Minimasi ∑𝑛=6 𝑚=4
    𝑖=1 ∑𝑘=1 𝑋𝑖𝑘

    Dengan kendala
    𝑋𝑖𝑘 + 𝑡𝑖𝑗𝑘 ≥ 𝑋𝑖ℎ untuk (i,j-i,h) << (i,j,k)
    𝑋𝑝𝑘 − 𝑋𝑖𝑘 + 𝑀(1 − 𝑌𝑖𝑝𝑘 ) ≥ 𝑡𝑝𝑞𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m
    𝑋𝑖𝑘 − 𝑋𝑝𝑘 + 𝑀𝑌𝑖𝑝𝑘 ≥ 𝑡𝑖𝑗𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    a. Fungsi Tujuan:
    Minimasi ∑𝑛=6 𝑚=4
    𝑖=1 ∑𝑘=1 𝑋𝑖𝑘

    Min Z = X11 + X12 + X13 + X14 + X21 + X22+ X23 + X24 +


    X31 + X32 + X33 + X34 + X41 + X42 + X43 + X44 +
    X51 + X52 + X53 + X54 + X61 + X62 + X63 + X64

    b. Fungsi Pembatas :
    Pembatas 3
    𝑋𝑖𝑘 − 𝑋𝑝𝑘 + 𝑀𝑌𝑖𝑝𝑘 ≥ 𝑡𝑖𝑗𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m
     Skenario pembatas 3-a dengan nilai 𝑌𝑖𝑝𝑘 = 1, maka
    𝑋𝑖𝑘 − 𝑋𝑝𝑘 + 𝑀𝑌𝑖𝑝𝑘 ≥ 𝑡𝑖𝑗𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    X11+X12+X13+X14+
    X21+X22+X23+X24+ X23+X32+X33+ M1+M2+ t23+t32+t33+
    X31+X32+X33+X34+ X41+X42+X43+ M3+M4+ t41+t42+t43+
    + + ≥
    X41+X42+X43+X44+ X51+X52+X53+ M5+M6 t51+t52+t53+
    X51+X52+X53+X54+ X61+X62+X63 t61+t62+t63
    X61+X62+X63+X64
     Skenario pembatas 3-b dengan nilai 𝑌𝑖𝑝𝑘 = 0, maka
    𝑋𝑖𝑘 − 𝑋𝑝𝑘 ≥ 𝑡𝑖𝑗𝑘 1≤ i,p ≤ n,1 ≤ k ≤ m

    X11+X12+X13+X14+ X11+X12+X13+X14+
    X21+X22+X23+X24+ X23+X32+X33+ X21+X22+X23+X24+
    X31+X32+X33+X34+ X41+X42+X43+ X31+X32+X33+X34+
    - ≥
    X41+X42+X43+X44+ X51+X52+X53+ X41+X42+X43+X44+
    X51+X52+X53+X54+ X61+X62+X63 X51+X52+X53+X54+
    X61+X62+X63+X64 X61+X62+X63+X64

    You might also like