Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Solver

    Uploaded by

    DiegoAguilar
    The document describes an optimization problem to minimize the total cost of transporting articles from plants to destinations. There are decision variables xij representing the number of articles transported from plant i to destination j. The objective is to minimize the total cost Z which is calculated as the sum of costs for each transportation. There are constraints on the maximum quantities that can be transported from each plant and constraints ensuring supply equals demand at each destination. The solution provided assigns quantities to each transportation to minimize the total cost of 39500.

    Copyright:

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

    You might also like

    Solver

    Uploaded by

    DiegoAguilar
    7 views2 pages
    The document describes an optimization problem to minimize the total cost of transporting articles from plants to destinations. There are decision variables xij representing the number of articles transported from plant i to destination j. The objective is to minimize the total cost Z which is calculated as the sum of costs for each transportation. There are constraints on the maximum quantities that can be transported from each plant and constraints ensuring supply equals demand at each destination. The solution provided assigns quantities to each transportation to minimize the total cost of 39500.

    Original Description:

    Original Title

    solver.xlsx

    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
    The document describes an optimization problem to minimize the total cost of transporting articles from plants to destinations. There are decision variables xij representing the number of articles transported from plant i to destination j. The objective is to minimize the total cost Z which is calculated as the sum of costs for each transportation. There are constraints on the maximum quantities that can be transported from each plant and constraints ensuring supply equals demand at each destination. The solution provided assigns quantities to each transportation to minimize the total cost of 39500.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    7 views2 pages

    Solver

    Uploaded by

    DiegoAguilar
    The document describes an optimization problem to minimize the total cost of transporting articles from plants to destinations. There are decision variables xij representing the number of articles transported from plant i to destination j. The objective is to minimize the total cost Z which is calculated as the sum of costs for each transportation. There are constraints on the maximum quantities that can be transported from each plant and constraints ensuring supply equals demand at each destination. The solution provided assigns quantities to each transportation to minimize the total cost of 39500.

    Copyright:

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

    Problema (Texto)

    Modelo:
    Variables x11 # de articulos a transportar de la planta 1 al destino 1
    x12

    x34 # de articulos a transportar de la planta 3 al destino 4

    OBJETIVO Z= 3x11+2x12+7x13+6x14+7x21+5x22+2x22+2x23+3x24+2x31+5x32+4x33+5x34

    RESTRICCIONES X11+X12+X13+X14<=5000
    X21+X22+X23+X24<=6000
    X31+X32+X33+X34<=2500
    X11+X21+X31=6000
    X12+X22+X32=4000
    X13+X23+X33=2000
    X14+X24+X34=1500
    X11,X12…..X34>=0

    SOLUCION:
    X11 X12 X13 X14 X21 X22 X23
    3500 1500 0 0 0 2500 2000
    1 1 1 1
    1 1 1

    1 1
    1 1
    1 1
    1
    3 2 7 6 7 5 2

    RESPUESTAS:
    X11 X12 X13 X14 X21 X22 X23
    3500 1500 0 0 0 2500 2000
    pagina 424 420 421

    Minimizar

    X24 X31 X32 X33 X34


    1500 2500 0 0 0
    5000 <= 5000
    1 6000 <= 6000
    1 1 1 1 2500 X= 2500
    1 6000 = 6000
    1 4000 = 4000
    1 2000 = 2000
    1 1 1500 = 1500
    3 2 5 4 5 39500 MINIMIZAR

    X24 X31 X32 X33 X34 Z


    1500 2500 0 0 0 39500

    You might also like