Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Tarea 3

    Uploaded by

    Carlos Palomar Aldrete
    The document describes a linear programming problem with the objective of minimizing Z = 3.6(X1 + X4 + X5 + X6 + X7 + X8) subject to 8 constraints on the variables X1 through X8. A table shows the values of the variables over time to satisfy the constraints.

    Copyright:

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

    You might also like

    Tarea 3

    Uploaded by

    Carlos Palomar Aldrete
    17 views1 page
    The document describes a linear programming problem with the objective of minimizing Z = 3.6(X1 + X4 + X5 + X6 + X7 + X8) subject to 8 constraints on the variables X1 through X8. A table shows the values of the variables over time to satisfy the constraints.

    Original Description:

    Investigacion de operaciones

    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 linear programming problem with the objective of minimizing Z = 3.6(X1 + X4 + X5 + X6 + X7 + X8) subject to 8 constraints on the variables X1 through X8. A table shows the values of the variables over time to satisfy the constraints.

    Copyright:

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

    Tarea 3

    Uploaded by

    Carlos Palomar Aldrete
    The document describes a linear programming problem with the objective of minimizing Z = 3.6(X1 + X4 + X5 + X6 + X7 + X8) subject to 8 constraints on the variables X1 through X8. A table shows the values of the variables over time to satisfy the constraints.

    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 1

    Carlos Palomar Aldrete ID: 0188691

    Tarea #3
    Funcin Objetivo: Min Z = 3.6(X1 + X4 + X5 + X6 + X7 + X8)
    Restricciones:

    X1 = 9
    X1 + X3 = 9
    X1 + X2 + X3 + X5 = 9
    X1 + X2 + X3 + X5 + X7 = 3
    X2 + X3 + X5 + X7 + X8 = 3
    X1 + X2 + X4 + X5 + X7 + X8 = 3
    X1 + X4 + X6 + X7 + X8 = 6
    X1 + X2 + X4 + X6 + X8 = 12
    X1 + X2 + X4 + X6 = 12
    X2 = 7
    11am 12pm 1pm 2pm 3pm 4pm 5pm 6pm 7pm - 8pm 9pm
    12pm 1pm 2pm 3pm 4pm 5pm 6pm 7pm 8pm 9pm 10pm
    X1 X1 X1 X1 X1 X1 X1 X1
    X2 X2 X2 X2 X2 X2 X2 X2
    X3 X3 X3 X3
    X4 X4 X4 X4
    X5 X5 X5 X5
    X6 X6 X6 X6
    X7 X7 X7 X7
    X8 X8 X8 X8
    9 9 9 3 3 3 6 12 12 7 7

    RESTRICCION RESTRICCION

    You might also like