Scribd Logo
Upload

Welcome to Scribd!

  • 0 views

    Libro 1

    Uploaded by

    m_michael_c
    This document defines a linear programming problem with the objective of maximizing z= 350x1 + 450x2 subject to the constraints x1 + 2x2 ≤ 12, x1 + x2 ≤ 7, and 3x1 + x2 ≤ 15, with non-negativity constraints x1, x2 ≥ 0. The simplex method is then used to solve the problem.

    Copyright:

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

    You might also like

    Libro 1

    Uploaded by

    m_michael_c
    0 views2 pages
    This document defines a linear programming problem with the objective of maximizing z= 350x1 + 450x2 subject to the constraints x1 + 2x2 ≤ 12, x1 + x2 ≤ 7, and 3x1 + x2 ≤ 15, with non-negativity constraints x1, x2 ≥ 0. The simplex method is then used to solve the problem.

    Original Description:

    Libro1

    Original Title

    Libro1

    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 defines a linear programming problem with the objective of maximizing z= 350x1 + 450x2 subject to the constraints x1 + 2x2 ≤ 12, x1 + x2 ≤ 7, and 3x1 + x2 ≤ 15, with non-negativity constraints x1, x2 ≥ 0. The simplex method is then used to solve the problem.

    Copyright:

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

    Libro 1

    Uploaded by

    m_michael_c
    This document defines a linear programming problem with the objective of maximizing z= 350x1 + 450x2 subject to the constraints x1 + 2x2 ≤ 12, x1 + x2 ≤ 7, and 3x1 + x2 ≤ 15, with non-negativity constraints x1, x2 ≥ 0. The simplex method is then used to solve the problem.

    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

    Max z= 350x1 + 450x2;

    x1 + 2x2 12
    x1 + x2 7
    3x1 + x2 15
    x1, x20

    x1 + 2x2 + x3= 12;


    x1 + x2 + x4=7
    3x1 + x2 + x5=15;

    CB=[0 0 0]
    CN=[350 450]
    1
    1
    3

    2
    1
    1

    1
    0
    0

    0
    1
    0

    0
    0
    1

    CBB-1-CN

    CBB-1b

    B-1N

    B-1b

    x3

    x4

    x5

    x1

    z
    x3
    x4

    1
    0
    0

    0
    1
    0

    0
    0
    1

    0
    0
    0

    -350
    1
    1

    x5

    x3

    x4

    x5

    x1

    351

    350

    350

    350

    x3
    x4

    -1
    -1

    0
    -1

    -1
    0

    -1
    -1

    0
    0

    x5

    CBB-1-CN
    C BB b
    -1

    =[-350 -450]
    =0

    x2
    -450
    2
    1

    0
    12
    7

    15

    x2
    -100

    350

    1
    0

    11
    6

    15

    You might also like