Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Metodo Simplex

    Uploaded by

    jazmin
    This document summarizes the solution to two linear programming problems using the Simplex method. The first problem aims to maximize Z = 2X1 + X2 subject to the constraints 10X1 + 10X2 ≤ 9 and 10X1 + 5X2 ≥ 1. The optimal solution is X1 = 9/10 and X2 = 5/9, with Z = 9/5. The second problem aims to maximize Z = 100X1 + 200X2 subject to the constraints 4X1 + 2X2 ≤ 16, 8X1 + 8X2 ≤ 16, and 2X2 ≤ 10. The optimal solution is X1 = 0 and X2 = 2, with Z

    Copyright:

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

    You might also like

    Metodo Simplex

    Uploaded by

    jazmin
    3 views4 pages
    This document summarizes the solution to two linear programming problems using the Simplex method. The first problem aims to maximize Z = 2X1 + X2 subject to the constraints 10X1 + 10X2 ≤ 9 and 10X1 + 5X2 ≥ 1. The optimal solution is X1 = 9/10 and X2 = 5/9, with Z = 9/5. The second problem aims to maximize Z = 100X1 + 200X2 subject to the constraints 4X1 + 2X2 ≤ 16, 8X1 + 8X2 ≤ 16, and 2X2 ≤ 10. The optimal solution is X1 = 0 and X2 = 2, with Z

    Original Description:

    Original Title

    Metodo simplex

    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
    This document summarizes the solution to two linear programming problems using the Simplex method. The first problem aims to maximize Z = 2X1 + X2 subject to the constraints 10X1 + 10X2 ≤ 9 and 10X1 + 5X2 ≥ 1. The optimal solution is X1 = 9/10 and X2 = 5/9, with Z = 9/5. The second problem aims to maximize Z = 100X1 + 200X2 subject to the constraints 4X1 + 2X2 ≤ 16, 8X1 + 8X2 ≤ 16, and 2X2 ≤ 10. The optimal solution is X1 = 0 and X2 = 2, with Z

    Copyright:

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

    Metodo Simplex

    Uploaded by

    jazmin
    This document summarizes the solution to two linear programming problems using the Simplex method. The first problem aims to maximize Z = 2X1 + X2 subject to the constraints 10X1 + 10X2 ≤ 9 and 10X1 + 5X2 ≥ 1. The optimal solution is X1 = 9/10 and X2 = 5/9, with Z = 9/5. The second problem aims to maximize Z = 100X1 + 200X2 subject to the constraints 4X1 + 2X2 ≤ 16, 8X1 + 8X2 ≤ 16, and 2X2 ≤ 10. The optimal solution is X1 = 0 and X2 = 2, with Z

    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 4

    INVESTIGACIÓN DE OPERACIONES

    Unidad 1: Programación Lineal

    “a2-T1 Método Simplex”


    • Función objetivo: Max Z ¿ 2 X 1 + X 2
    Sujeto a:
    10 X 1 +10 X 2≤9

    10 X 1 +5 X 2≥1

    X 1 , X 2≥0

    X1 X2 s1 s2 s3 s4 z
    *s1 1 0 -1 0 0 0 0 0
    *s2 0 1 0 -1 0 0 0 0
    S3 10 10 0 0 1 0 0 9
    *s4 10 5 0 0 0 -1 0 1
    z -2 -1 0 0 0 0 1 0

    X1 X2 s1 s2 s3 s4 z
    s1 0 0.5 1 0 0 -0.1 0 0.1
    s2 0 -1 0 1 0 0 0 0
    s3 0 5 0 0 1 1 0 8
    x 1 0.5 0 0 0 -0.1 0 0.1
    z 0 0 0 0 0 -0.2 1 0.2

    X1 X2 s1 s2 s3 s4 z
    s1 0 1 1 0 0.1 0 0 0.9
    s2 0 -1 0 1 0 0 0 0
    s3 0 5 0 0 1 1 0 8
    x 1 1 0 0 0.1 0 0 0.9
    z 0 1 0 0 0.2 0 1 1.8

    9
    Z=
    5
    9
    x 1=
    10
    x 2=0

    Problema 2:
    • Función objetivo: Max Z ¿ 100 X 1 +200 X 2
    Sujeto a:
    4 X 1 +2 X 2≤16
    8 X 1 +8 X 2≤16

    2 X 2≤10

    X 1 , X 2≥0

    x1 x2 s1 s2 s3 s4 s5 s6 z
    *s1 1 0 0 1 0 0 0 0 0 0 0
    *s2 0 1 0 0 -1 0 0 0 0 0 0
    S3 4 0 2 0 0 -1 0 0 0 0 16
    *s4 8 8 0 0 0 0 1 0 0 0 16
    s5 0 2 0 0 0 0 0 1 0 0 10
    s6 4 0 2 0 0 0 0 0 1 0 16
    z -100 -200 0 0 0 0 0 0 0 1 0

    x1 x2 s1 s2 s3 s4 s5 s6 z
    *s1 0 1 0 1 0 0 0.125 0 0 0 2
    *s2 0 -1 0 0 1 0 0 0 0 0 0
    S3 0 -4 2 0 0 -1 -0.5 0 0 0 8
    *s4 1 1 0 0 0 0 0.125 0 0 0 2
    s5 0 2 0 0 0 0 0 1 0 0 10
    s6 0 -4 2 0 0 0 -0.5 0 1 0 8
    z 0 -100 0 0 0 0 12.5 0 0 1 200

    x1 x2 s1 s2 s3 s4 s5 s6 z
    *s1 0 1 0 1 0 0 0.125 0 0 0 2
    *s2 0 -1 0 0 1 0 0 0 0 0 0
    S3 0 -2 1 0 0 -0.5 -0.25 0 0 0 4
    *s4 1 1 0 0 0 0 0.125 0 0 0 2
    s5 0 2 0 0 0 0 0 1 0 0 10
    s6 0 0 0 0 0 1 0 0 1 0 0
    z 0 -100 0 0 0 0 12.5 0 0 1 200

    x1 x2 s1 s2 s3 s4 s5 s6 z
    *s1 0 1 0 1 0 0 0.125 0 0 0 2
    *s2 0 0 0 1 1 0 0.125 0 0 0 2
    S3 0 0 1 2 0 -0.5 0 0 0 0 8
    *s4 1 0 0 -1 0 0 0 0 0 0 0
    s5 0 0 0 -2 0 0 -0.25 1 0 0 6
    s6 0 0 0 0 0 1 0 0 1 0 0
    z 0 0 0 100 0 0 25 0 0 1 400
    Z=400
    x 1=0
    x 2=2

    You might also like