Scribd Logo
Upload

Welcome to Scribd!

  • Mutli No 3..

    Uploaded by

    Bagus Channel
    22 views4 pages
    The document defines a linear programming model that minimizes the total cost of production across multiple products and facilities subject to capacity and demand constraints. The objective function minimizes the total costs which are defined as the sum of production costs for each product-facility combination. The constraints ensure production does not exceed facility capacities, demands are met, and production amounts remain non-negative.

    Original Description:

    Original Title

    mutli no 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 defines a linear programming model that minimizes the total cost of production across multiple products and facilities subject to capacity and demand constraints. The objective function minimizes the total costs which are defined as the sum of production costs for each product-facility combination. The constraints ensure production does not exceed facility capacities, demands are met, and production amounts remain non-negative.

    Copyright:

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

    Mutli No 3..

    Uploaded by

    Bagus Channel
    The document defines a linear programming model that minimizes the total cost of production across multiple products and facilities subject to capacity and demand constraints. The objective function minimizes the total costs which are defined as the sum of production costs for each product-facility combination. The constraints ensure production does not exceed facility capacities, demands are met, and production amounts remain non-negative.

    Copyright:

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

    MIN= 6400*XAD + 5450*XAE + 3040*XAF + 4500*XAG + 7000*XBD + 5970*XBE + 4400*XBF +

    3400*XBG + 12400*XDH + 11070*XEH + 10500*XFH + 11040*XGH + 10090*XDI + 12400*XEI +


    11700*XFI + 12300*XGH + 12970*XDI + 10580*XEJ + 11320*XFJ + 11600*XGJ + 2100*XH1 + 2550*XH2 +
    2040*XH3 + 3120*XH4 + 4020*XH5 + 1734*XI1 + 2820*XI2 + 3450*XI3 + 4200*XI4 + 0470*XI5 +
    2200*XJ1 + 2100*XJ2 + 0400*XJ3 + 2150*XJ4 + 2540*XJ5 + 150400000*YD + 104000000*YE +
    205000000*YF + 204000000*YG + 140000000*YH + 150400000*YJ + 120000000*YI;

    XAD+XAE+XAF+XAG<=2090000;
    XBD+XBE+XBF+XBG<=2090000;
    XAD+XBD-XDH-XDI-XDJ>=0;
    XAE+XBE-XEH-XEI-XEJ>=0;
    XAF+XBF-XFH-XFI-XFJ>=0;
    XAG+XBG-XGH-XGI-XGJ>=0;
    XDH+XDI+XDJ-2254000*YD >=0;
    XEH+XEI+XEJ-1040000*YE>=0;
    XFH+XFI+XFJ-2500000*YF>=0;
    XGH+XGI+XGJ-1604000*YG>=0;
    XDH+XEH+XFH+XGH-H1-H2-H3-H4-H5 >=0;
    XDI+XEI+XFI+XGI-I1-I2-I3-I4-I5>=0;
    XDJ+XEJ+XFJ+XGJ-J1-J2-J3-J4-J5>=0;
    XH1+XH2+XH3+XH4+XH5- 140000000* YH <= 0;
    XI1+XI2+XI3+XI4+XI5- 150400000* YJ <= 0;
    XJ1+XJ2+XJ3+XJ4+XJ5- 120000000* YI <= 0;
    XH1+XI1+XJ1 = 600000;
    XH2+XI2+XJ2 = 250000;
    XH3+XI3+XJ3 = 004000;
    XH4+XI4+XJ4 = 200000;
    XH5+XI5+XJ5 = 434000;
    YD>=0;
    YE>=0;
    YF>=0;
    YG>=0;
    H>=0;
    I>=0;
    J>=0;
    @bin (YD);
    @bin (YE);
    @bin(YF);
    @bin(YG);
    END

    You might also like