Scribd Logo
Upload

Welcome to Scribd!

  • Guia N3 Simplex

    Uploaded by

    Marco Enrique Rodriguez Leiva
    12 views1 page
    This document provides 7 examples of linear programming problems involving optimization using the simplex method. The problems involve maximizing or minimizing objective functions subject to various inequality and equality constraints involving variables X1, X2, X3 and X4, which must be greater than or equal to 0. The document also provides contact information for the professor Sebastián Miranda.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides 7 examples of linear programming problems involving optimization using the simplex method. The problems involve maximizing or minimizing objective functions subject to various inequality and equality constraints involving variables X1, X2, X3 and X4, which must be greater than or equal to 0. The document also provides contact information for the professor Sebastián Miranda.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views1 page

    Guia N3 Simplex

    Uploaded by

    Marco Enrique Rodriguez Leiva
    This document provides 7 examples of linear programming problems involving optimization using the simplex method. The problems involve maximizing or minimizing objective functions subject to various inequality and equality constraints involving variables X1, X2, X3 and X4, which must be greater than or equal to 0. The document also provides contact information for the professor Sebastián Miranda.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    OPTIMIZACIN

    SIMPLEX

    Profesor:

    Sebastin Miranda

    Correo:

    Smiranda@ipciisa.cl

    1.- min

    z = 4X1 + 4X2+X3

    s.a.

    2X1 + X2 + X3 2

    2.- max
    s.a.

    2X1 + X2 3
    2X1 + X2 + 3X3 3
    X1, X2, X3 0

    3.- max

    z = 36X1 + 30X2 - 3X3 4X4

    s.a.

    X1 + X2 X3 5

    4.- min
    s.a.

    6X1 + 5X2 X4 10
    X1, X2, X3, X4 0

    5.- max

    z = 5X1 + 3X2

    6.- min z

    z = 2X1 + 3X2

    s.a.

    4X1 + 2X2 12

    s.a.

    X1 + X2 4

    4X1 + X2 10

    X1 + 3X2 36

    X1 + X2 4

    X1 + X2 = 10

    X1, X2 0

    X1, X2 0

    7.- max

    z = 30X1 4X2

    s.a.

    5X1 30 + X2
    X1 5
    X1 0, X2 Irrestricta

    You might also like