Scribd Logo
Upload

Welcome to Scribd!

  • Ejercicio 1 Io

    Uploaded by

    geminis agario tum
    21 views8 pages
    This document describes a linear programming problem with the objective of maximizing Z=6X1+3X2+5X3 subject to various constraints involving the variables X1, X2, X3, X4, and X5. The simplex method is used to solve the problem by setting up an initial simplex tableau and performing iterations to arrive at an optimal solution.

    Original Description:

    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 describes a linear programming problem with the objective of maximizing Z=6X1+3X2+5X3 subject to various constraints involving the variables X1, X2, X3, X4, and X5. The simplex method is used to solve the problem by setting up an initial simplex tableau and performing iterations to arrive at an optimal solution.

    Copyright:

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

    Ejercicio 1 Io

    Uploaded by

    geminis agario tum
    This document describes a linear programming problem with the objective of maximizing Z=6X1+3X2+5X3 subject to various constraints involving the variables X1, X2, X3, X4, and X5. The simplex method is used to solve the problem by setting up an initial simplex tableau and performing iterations to arrive at an optimal solution.

    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 8

    Funcion objetivo

    Max Z = 6X1 + 3X2 + 5X3

    ST

    2X1 + 5X2 + 7X3 +


    3X1 + 4X2 + 1X3 +
    X3 >= 100
    X4 <= 150
    X5 <= 250
    X1 , X2 , X3 ,

    R1 2X1 + 5X2 + 7X3 + 9X4


    R2 3X1 + 4X2 + 1X3 + 6X4
    R3 X3
    X4

    igualar funcion objetivo a 0


    - 6X1 - 3X2 - 5X3 - 4X4

    DESARRROLLAR LA TABLA INCIAL SIMPLEX


    X1 X2 X3 X4 X5 X6 X7
    Z -6 -3 -5 -4 -5 0 0
    X6 2 5 7 9 7 1 0
    X7 3 4 1 6 5 0 1
    X8 0 0 1 0 0 0 0
    X9 0 0 0 1 0 0 0
    X10 0 0 0 0 1 0 0

    X1 X2 X3 X4 X5 X6 X7
    Z -6 -3 -5 -4 -5 0 0
    X6 2 5 7 9 7 1 0
    X7 3 4 1 6 5 0 1
    X8 0 0 1 0 0 0 0
    X9 0 0 0 1 0 0 0
    X10 0 0 0 0 1 0 0

    X1 X2 X3 X4 X5 X6 X7
    Z -6 -3 -2 -4 -5 0 0
    X6 2 5 6 9 7 1 0
    X7 3 4 -0.5 6 5 0 1
    X1 0 0 0.5 0 0 0 0
    X9 0 0 0 1 0 0 0
    X10 0 0 0 0 1 0 0

    X1 X2 X3 X4 X5 X6 X7
    Z
    X6
    X7
    X1
    X9
    X10
    + 4X4 + 5X5

    9X4 + 7X5 <= 10000


    6X4 + 5X5 <= 5000

    X4 , X5 >= 0

    + 7X5 + X6
    + 5X5 + X7
    + X8

    X5

    - 5X5 + 0X6 + 0X7 + 0X8


    X8 X9 X10 VS
    0 0 0 0
    0 0 0 10000
    0 0 0 5000
    1 0 0 100
    0 1 0 150
    0 0 1 250

    X8 X9 X10 VS
    0 0 0 0
    0 0 0 10000 5000
    0 0 0 5000 1666.66667
    1 0 0 100 0
    0 1 0 150 0
    0 0 1 250 0

    X8 X9 X10 VS
    3 0 0 300
    -1 0 0 9900
    -1.5 0 0 4850
    0.5 0 0 50
    0 1 0 150
    0 0 1 250

    X8 X9 X10 VS
    = 10000
    = 5000
    = 100
    + X9 = 150
    + X10 = 250

    + 0X9 + 0X10

    You might also like