Scribd Logo
Upload

Welcome to Scribd!

  • 1 Modelo de Examen - Metodo Simplex

    Uploaded by

    Silvia Suyo Lopez
    5 views4 pages
    The document describes the simplex method for solving linear programming problems in 5 steps: 1) Write the problem in standard form, 2) Determine the number of restrictions, 3) Transform the problem into standard form, 4) Create a tableau with the constraints and variables, 5) Find the pivot element and solve by iterating through the tableau until an optimal solution is reached. The example problem is to maximize profits given constraints on production levels, and the optimal solution found maximizes profits at $40,000 by setting X1 to 100 and X2 to 200.

    Original Description:

    Original Title

    1 MODELO DE EXAMEN - METODO SIMPLEX

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the simplex method for solving linear programming problems in 5 steps: 1) Write the problem in standard form, 2) Determine the number of restrictions, 3) Transform the problem into standard form, 4) Create a tableau with the constraints and variables, 5) Find the pivot element and solve by iterating through the tableau until an optimal solution is reached. The example problem is to maximize profits given constraints on production levels, and the optimal solution found maximizes profits at $40,000 by setting X1 to 100 and X2 to 200.

    Copyright:

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

    1 Modelo de Examen - Metodo Simplex

    Uploaded by

    Silvia Suyo Lopez
    The document describes the simplex method for solving linear programming problems in 5 steps: 1) Write the problem in standard form, 2) Determine the number of restrictions, 3) Transform the problem into standard form, 4) Create a tableau with the constraints and variables, 5) Find the pivot element and solve by iterating through the tableau until an optimal solution is reached. The example problem is to maximize profits given constraints on production levels, and the optimal solution found maximizes profits at $40,000 by setting X1 to 100 and X2 to 200.

    Copyright:

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

    METODO SIMPLEX

    1ºPASO: COPIAR EL ENUNCIADO ( FORMA TIPICA)


    PROBLEMA

    MAXIMIZAR Z = 100 X1 + 150 X2 F.0. (FUNCION OBJETIVO)

    Sujeto a: X1 + X2 ≤ 300 R1
    X1 ≤ 200 R2 2º PASO: VERIFICAR CUANTAS RESTICCIONES TENEMOS
    X2 ≤ 200 R3
    signos y variables :
    CON : X1,X2 ≥ 0
    = Sumar una Variables Artificial
    ≤ Sumar una variable de Holgura
    3º PASO: TRANSFROMAR EN FORMA ESTRANDAR
    ≥ restar una variable de Holgura negativa (superficial) y Sumar una variable artificial
    MAXIMIZAR Z = 100 X1 + 150 X2
    MAX Z = - 100 X1 - 150 X2 + 0 H3 + 0 H4 + 0 H5 = 0

    X1 + X2 + H3 0 0 = 300 H
    X1 0 `+ H4 0 = 200
    X2 0 0 + H5 = 200

    CON : X1, X2, H3, H4, H5 ≥ 0

    SOLUCION INICIAL

    H3 = 300 X1 = 0
    H4 = 200 X2 = 0
    H5 = 200
    Z = 0

    4ºPASO: TABLA DE DATOS


    5ºPASO: ENCONTARA EL ELEMENTO PIVOTE
    TABLA Nº 1
    MAX X1 X2 H3 H4 H5 LD X2 LD
    300 300
    FO: Z -100 -150 0 0 0 0 R1
    1 300 = 1
    =
    200 CUANDO APARECE INFINITO NO SE LE TOMA EN
    R1 R1 H3 1 1 1 0 0 300 R2
    0 200 = 0
    = ∞ CUENTA
    200
    R2
    R2 H4 1 0 0 1 0 200 R3
    1 200 = 1
    = 200

    R3 H5 0 1 0 0 1 200
    R3 F.P.
    C.P.
    X1 X2 H3 H4 H5 LD 0/ 1= 0
    1/1 = 1
    R3 = 0 1 0 0 1 200
    1 200/1 = 200

    R3 = 0 1 0 0 1 200 ✔

    1500 x 0 = 0
    FO = -100 -150 0 0 0 0
    150 x 200 = 30000
    R3(150) = 0 150 0 0 150 30000

    FO : = -100 0 0 0 150 30000 ✔


    R1 = 1 1 1 0 0 300

    R3(-1) = 0 -1 0 0 -1 -200

    R1 : = 1 0 1 0 -1 100 ✔
    R2 = 1 0 0 1 0 200

    R3(-0) = 0 0 0 0 0 0

    R2 : = 1 0 0 1 0 200 ✔

    TABLA Nº 2
    MAX X1 X2 H3 H4 H5 LD X1 LD
    100 100
    FO: Z -100 0 0 0 150 30000
    R1
    1 100
    1
    =
    200
    R1 H3 1 0 1 0 -1 100
    F.P.
    1 200 1 = 200
    R2
    200
    R2 H4 1 0 0 1 0 200 R3
    0 200
    0
    = ∞
    R3 X2 0 1 0 0 1 200
    C.P.
    1/1 = 1
    R1 = 1 0 1 0 -1 100 100/1 = 100
    1

    R1 = 1 0 1 0 -1 100 ✔

    FO = -100 0 0 0 150 30000 100 x 1=100


    100 x 0 = 0
    R1(100) = 100 0 100 0 -100 10000

    FO : = 0 0 100 0 50 40000 ✔

    R2 = 1 0 0 1 0 200

    R1(-1) = -1 0 -1 0 1 -100

    R2 : = 0 0 -1 1 1 100 ✔
    R3 = 0 1 0 0 1 200

    R1(-0) = 0 0 0 0 0 0

    R3 : = 0 1 0 0 1 200 ✔

    TABLA Nº 3
    MAX X1 X2 H3 H4 H5 LD

    FO: Z 0 0 100 0 50 40000

    R1 X1 1 0 1 0 -1 100

    R2 H4 0 0 -1 1 1 100

    R3 X2 0 1 0 0 1 200
    SOLUCION

    X1 = 100 H3 = 0

    X2 = 200

    H4 = 100 H5 = 0

    Z = 40000

    You might also like