Scribd Logo
Upload

Welcome to Scribd!

  • Z (Min) Costo Total de La Operecion 0 X11 X12 X13 X21 X22 Costos (Arco) 24 30 40 30 40

    Uploaded by

    Matt Siul
    9 views11 pages
    This document contains several linear programming problems with the goal of minimizing total costs subject to constraints. The problems involve optimizing variables like production amounts, transportation routes, and resource allocation across multiple activities with defined cost structures and capacity limits.

    Original Description:

    excel solver

    Original Title

    solver

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains several linear programming problems with the goal of minimizing total costs subject to constraints. The problems involve optimizing variables like production amounts, transportation routes, and resource allocation across multiple activities with defined cost structures and capacity limits.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views11 pages

    Z (Min) Costo Total de La Operecion 0 X11 X12 X13 X21 X22 Costos (Arco) 24 30 40 30 40

    Uploaded by

    Matt Siul
    This document contains several linear programming problems with the goal of minimizing total costs subject to constraints. The problems involve optimizing variables like production amounts, transportation routes, and resource allocation across multiple activities with defined cost structures and capacity limits.

    Copyright:

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

    Z(MIN) COSTO TOTAL DE LA OPERECION 0

    X11 X12 X13 X21 X22

    COSTOS(ARCO) 24 30 40 30 40

    SUJETO A: RESTRICCIONES X11 X12 X13 X21 X22


    1 1 1 0 0
    0 0 0 1 1
    1 0 0 1 0
    0 1 0 0 1
    0 0 1 0 0
    X23

    42

    X23 lado izquierdo lado derecho


    0 0 <= 50
    1 0 <= 50
    0 0= 25
    0 0= 45
    1 0= 10
    Z(MIN) COSTO TOTAL DE LA 0
    X11 X12 X13 X21 X22 X23

    COSTOS(ARCO) 50 36 16 28 30 18

    SUJETO A: RESTRICCIONES X11 X12 X13 X21 X22 X23


    agente 1 1 1 0 0 0
    agente 0 0 0 1 1 1
    agente 0 0 0 0 0 0
    agente 0 0 0 0 0 0
    tarea a realizar 1 0 0 1 0 0
    tarea a realizar 0 1 0 0 1 0
    tarea a realizar 0 0 1 0 0 1
    X31 X32 X33 X41 X42 X43

    35 32 20 25 25 14

    X31 X32 X33 X41 X42 X43 lado izquierdo lado derecho
    0 0 0 0 0 0 0 <= 1
    0 0 0 0 0 0 0 <= 1
    1 1 1 0 0 0 0 <= 1
    0 0 0 1 1 1 0 <= 1
    1 0 0 1 0 0 0= 1
    0 1 0 0 1 0 0= 1
    0 0 1 0 0 1 0= 1
    lado derecho
    A
    B
    C
    D
    E
    F
    G
    Z(MIN) COSTO TOTAL DE LA 0
    X13 X14 X23 X24 X35 X36

    COSTOS(ARCO) 5 8 7 4 1 5

    SUJETO A: RESTRICCIONES X13 X14 X23 X24 X35 X36


    OFERTA 1 1 0 0 0 0
    OFERTA 0 0 1 1 0 0
    TRANSBORDO 1 0 1 0 -1 -1
    TRANSBORDO 0 1 0 1 0 0
    DEMANDA 0 0 0 0 1 0
    DEMANDA 0 0 0 0 0 1
    DEMANDA 0 0 0 0 0 0
    X37 X45 X46 X47

    8 3 4 4

    X37 X45 X46 X47 lado izquierdo lado derecho


    0 0 0 0 0 <= 75
    0 0 0 0 0 <= 75
    -1 0 0 0 0= 0
    0 -1 -1 -1 0= 0
    0 1 0 0 0= 50
    0 0 1 0 0= 60
    1 0 0 1 0= 40
    lado derecho
    Z(MIN) VALOR OPTIMO VP 46
    X1 X2
    5 3
    COSTOS(ARCO) 5 7

    SUJETO A: RESTRICCIONES X1 X2
    1 0
    2 3
    1 1
    lado izquierdo lado derecho
    5 <= 6
    19 <= 19
    8 <= 8
    M

    You might also like