Scribd Logo
Upload

Welcome to Scribd!

  • Ampl File 17

    Uploaded by

    lascurainjose
    4 views2 pages
    The document describes an optimization model that determines the optimal allocation of production across 4 machines to minimize total costs while meeting a demand of 2000 units. The objective is to minimize the variable production costs plus fixed costs of operating each machine. Constraints include not exceeding each machine's capacity and ensuring total production equals demand. The model is solved, finding an optimal solution using machines 1 and 3 at 800 and 1200 units respectively, with a total cost of $37,000.

    Original Description:

    Original Title

    AMPL FILE 17

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an optimization model that determines the optimal allocation of production across 4 machines to minimize total costs while meeting a demand of 2000 units. The objective is to minimize the variable production costs plus fixed costs of operating each machine. Constraints include not exceeding each machine's capacity and ensuring total production equals demand. The model is solved, finding an optimal solution using machines 1 and 3 at 800 and 1200 units respectively, with a total cost of $37,000.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views2 pages

    Ampl File 17

    Uploaded by

    lascurainjose
    The document describes an optimization model that determines the optimal allocation of production across 4 machines to minimize total costs while meeting a demand of 2000 units. The objective is to minimize the variable production costs plus fixed costs of operating each machine. Constraints include not exceeding each machine's capacity and ensuring total production equals demand. The model is solved, finding an optimal solution using machines 1 and 3 at 800 and 1200 units respectively, with a total cost of $37,000.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    AMPL FILE

    Problem 17)

    MODEL

    set MACHINE;

    param fixedc {MACHINE} >= 0;


    param Costvar {MACHINE} >=0;
    param Capacity {MACHINE} >=0;
    #param Demand {MACHINE} >=0;

    var Supply {MACHINE}>=0;


    var UseM {MACHINE} binary;

    minimize Total_Cost:
    sum {i in MACHINE} Costvar[i] * Supply[i]
    +sum {i in MACHINE} fixedc[i] * UseM[i];

    subject to Cap {i in MACHINE}:


    Supply[i]<=Capacity[i];

    subject to Output:
    sum {i in MACHINE} Supply[i]= 2000;

    subject to useofmachines:
    sum {i in MACHINE} UseM[i]*Supply[i] = sum {i in MACHINE} Supply[i];

    DATA

    data;

    set MACHINE := 1 2 3 4 ;

    param: fixedc:=
    1 1000
    2 920
    3 800
    4 700 ;

    param: Costvar:=
    1 20
    2 24
    3 16
    4 28;

    param: Capacity:=
    1 900
    2 1000
    3 1200
    4 1600;
    RESULTS

    ampl: include "C:\Documents and


    Settings\lascuja\Desktop\amplcml\MODELS\HW6\prob
    lem17.mod"
    ampl: include "C:\Documents and
    Settings\lascuja\Desktop\amplcml\MODELS\HW6\prob
    lem17.dat"
    ampl: solve;
    MINOS 5.5: ignoring integrality of 4 variables
    MINOS 5.5: optimal solution found.
    8 iterations, objective 37000
    Nonlin evals: constrs = 13, Jac = 12.
    ampl: display Supply;
    Supply [*] :=
    1 800
    2 0
    3 1200
    4 0
    ;

    ampl:

    You might also like