Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    Tema1 Tarea

    Uploaded by

    Xris
    The document describes a multi-objective programming problem with constraints and goals. It provides the constraints as both hard restrictions and soft goals expressed as equations. The solution provided is A=2.857143 and B=8.571429, which satisfies all three goal restrictions of minimizing costs, meeting hour requirements, and maintaining positive values. A second example problem is given with assigning technicians to repair jobs under resource constraints. The five goals are shown to be satisfied by the assignments of technicians 1, 2, and 3.

    Copyright:

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

    You might also like

    Tema1 Tarea

    Uploaded by

    Xris
    24 views3 pages
    The document describes a multi-objective programming problem with constraints and goals. It provides the constraints as both hard restrictions and soft goals expressed as equations. The solution provided is A=2.857143 and B=8.571429, which satisfies all three goal restrictions of minimizing costs, meeting hour requirements, and maintaining positive values. A second example problem is given with assigning technicians to repair jobs under resource constraints. The five goals are shown to be satisfied by the assignments of technicians 1, 2, and 3.

    Original Description:

    INVESTIG OPERATIVA

    Original Title

    TEMA1-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 a multi-objective programming problem with constraints and goals. It provides the constraints as both hard restrictions and soft goals expressed as equations. The solution provided is A=2.857143 and B=8.571429, which satisfies all three goal restrictions of minimizing costs, meeting hour requirements, and maintaining positive values. A second example problem is given with assigning technicians to repair jobs under resource constraints. The five goals are shown to be satisfied by the assignments of technicians 1, 2, and 3.

    Copyright:

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

    Tema1 Tarea

    Uploaded by

    Xris
    The document describes a multi-objective programming problem with constraints and goals. It provides the constraints as both hard restrictions and soft goals expressed as equations. The solution provided is A=2.857143 and B=8.571429, which satisfies all three goal restrictions of minimizing costs, meeting hour requirements, and maintaining positive values. A second example problem is given with assigning technicians to repair jobs under resource constraints. The five goals are shown to be satisfied by the assignments of technicians 1, 2, and 3.

    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 1: Tarea - Ejercicios de la

    programación multiobjetivo

    MIN=D1+D2+E2+E3;
    !RESTRICCIONES DURAS;
    [MAQ1]1*A+3*B<=60;
    [MAQ2]4*A+2*B<=60;
    [MAQ3]3*A+4*B<=60;
    !RESTRICCIONES BLANDAS (METAS)
    PV-COSTOS
    [PROC1]55 - 1*5+4*5+3*5=15
    [PROC2]75 - 3*5+2*5+4*5=30;
    [META1]15*A+30*B>=300;
    !HORAS M1=HORAS M2
    1A+3B=4A+2B;
    [META2]-3*A+B=0;
    !HORAS DE M3<=2M2
    3A+4B<=2(1A+3B);
    [META3]A-2*B<=0;
    !RESTRICCIONES EXPRESADAS COMO METAS;
    15*A+30*B+D1-E1=300;
    -3*A+B+D2-E2=0;
    A-2*B+D3-E3=0;

    End

    A= 2.857143
    B= 8.571429

    [META1]15*A+30*B>=300;
    15*(2.86)+30*(8.57)=300 SI CUMPLE

    [META2]-3*A+B=0;
    -3*(2.86)+(8.57)=0 SI CUMPLE

    [META3]A-2*B+D3-E3<=0;
    (2.86)-2*(8.57)+(14.28)-0=-0 SI CUMPLE
    MIN=E1+D2+E2+D3+E3+D4+E4+E5;
    !RESTRICCIONES DURAS
    lavadoras= L
    refrig= R
    COCINAS=C;
    L1+L2+L3=20;
    R1+R2+R3=15;
    C1+C2+C3=10;
    !RESTRICCIONES BLANDAS (METAS)
    5*L1+6*R1+4*C1+4*L2+7*R2+4*C2+7*L3+8*R3+3*C3=0
    L1=R1
    R1=C1
    L1=C1
    4*L2+7*R2+4*C2−50≤7*L3+8*R3+3*C3;
    !RESTRICCIONES EXPRESADAS COMO METAS;
    [META1]5*L1+6*R1+4*C1+4*L2+7*R2+4*C2+7*L3+8*R3+3*C3+D1-E1=0;
    [META2]L1-R1+D2-E2=0;
    R1-C1+D3-E3=0;
    L1-C1+D4-E4=0;
    [META3]4*L2+7*R2+4*C2-7*L3-8*R3-3*C3+D5-E5=50;
    end

    Maximo se puede reducir 222.


    Técnicos pueden reparar:
    T1=0L, 0R,0C
    T2=20L,8R, 0C
    T3=0L, 7R, 10C
    [META1]
    5L1+6R1+4C1+4L2+*R2+4C2+7L3+8R3+3C3+D1-
    E1=0;
    50(0)+6(0)+4(0)+4(20)+7(8)+4(0)+7(0)+8(7)+3(10)+(0)-
    (222)=0 SI CUMPLE
    [META2]
    L1-R1+D2-E2=0;
    (0)-(0)+(0)-(0)=0 SI CUMPLE
    R1-C1+D3-E3=0;
    (0)-(0)+(0)-(0)=0 SI CUMPLE
    L1-C1+D4-E4=0;
    (0)-(0)+(0)-(0)=0 SI CUMPLE
    [META3]
    4L2+7R2+4C2-7L3-8R3-3C3+D5-E5=50
    4(20)+7(8)+4(0)-7(0)-8(7)-3(10)+(0)-(0)=50 SI CUMPLE

    You might also like