Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Tema2 Tarea

    Uploaded by

    Xris
    The document describes two optimization problems involving integer programming models. The first models production and purchasing constraints to minimize costs. It provides the optimal solution which minimizes to $20,885. The second models worker scheduling constraints to minimize the number of workers needed. The optimal solution is 22 workers.

    Copyright:

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

    You might also like

    Tema2 Tarea

    Uploaded by

    Xris
    8 views3 pages
    The document describes two optimization problems involving integer programming models. The first models production and purchasing constraints to minimize costs. It provides the optimal solution which minimizes to $20,885. The second models worker scheduling constraints to minimize the number of workers needed. The optimal solution is 22 workers.

    Original Description:

    INVESTIG OPERATIVA

    Original Title

    TEMA2-TAREA

    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 two optimization problems involving integer programming models. The first models production and purchasing constraints to minimize costs. It provides the optimal solution which minimizes to $20,885. The second models worker scheduling constraints to minimize the number of workers needed. The optimal solution is 22 workers.

    Copyright:

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

    Tema2 Tarea

    Uploaded by

    Xris
    The document describes two optimization problems involving integer programming models. The first models production and purchasing constraints to minimize costs. It provides the optimal solution which minimizes to $20,885. The second models worker scheduling constraints to minimize the number of workers needed. The optimal solution is 22 workers.

    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 3

    Semana 6 - Tema 2: Tarea - Ejercicios

    acerca de modelos de programación entera

    MIN=75*PF1+60*PF2+40*PF3+30*PF4+85*PC1+65*PC2+30*PC3;
    [MP1]6*PF1+3*PF2+5*PF3+4*PF4<=1000;
    [MP2]4*PF1+7*PF2+2*PF3+5*PF4<=1200;
    PF1+PC1>=100;
    PF2+PC2>=110;
    PF3+PC3>=120;
    PF4>=90;
    @GIN(PF1);
    @GIN(PF2);
    @GIN(PF3);
    END

    Podra minimizar: $ 20885


    Produce(und):
    PF1= 100
    PF2=13
    PF3=0
    PF4=90
    Compra(und):
    PC1=0
    PC2=97
    PC3=120
    Graficando:

    L M M J V S D
    T1
    T2
    T3
    T4
    T5
    T6
    T7
    MIN=T1+T2+T3+T4+T5+T6+T7;
    [L]T1+T4+T5+T6+T7>=17;
    [M]T1+T2+T5+T6+T7>=13;
    [MI]T1+T2+T3+T6+T7>=15;
    [J]T1+T2+T3+T4+T7>=18;
    [V]T1+T2+T3+T4+T5>=14;
    [S]T2+T3+T4+T5+T6>=16;
    [D]T3+T4+T5+T6+T7>=11;
    @GIN(T1);
    @GIN(T2);
    @GIN(T3);
    @GIN(T4);
    @GIN(T5);
    @GIN(T6);
    @GIN(T7);
    END

    Se podrá minimizar 22 trabajadores.


    Se podrá usar (cant. trabajdores):
    T1 (L-V) =6
    T2 (M-S) =5
    T3 (MI-D) =0
    T4 (J-L) =7
    T5 (V-M) =0
    T6 (S-MI) =4
    T7 (D-J) =0

    You might also like