Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Deber Lab Io

    Uploaded by

    Martin
    This document contains the formulation and solution steps for several linear programming problems. The first problem defines an objective function z and constraints on variables x1 and x2. The simplex method is used to solve for the optimal values of x1 and x2. The second problem defines another objective function z in terms of variables x1, x2, and x3, along with constraints on the variables. Again, the simplex method is applied to solve for the optimal variable values. The third problem formulates yet another linear program with a different objective function and constraints. The simplex method yields the optimal objective value of 14 and optimal variable values of x1=0.5, x3=4

    Copyright:

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

    You might also like

    Deber Lab Io

    Uploaded by

    Martin
    8 views5 pages
    This document contains the formulation and solution steps for several linear programming problems. The first problem defines an objective function z and constraints on variables x1 and x2. The simplex method is used to solve for the optimal values of x1 and x2. The second problem defines another objective function z in terms of variables x1, x2, and x3, along with constraints on the variables. Again, the simplex method is applied to solve for the optimal variable values. The third problem formulates yet another linear program with a different objective function and constraints. The simplex method yields the optimal objective value of 14 and optimal variable values of x1=0.5, x3=4

    Original Description:

    Original Title

    DEBER LAB IO

    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 contains the formulation and solution steps for several linear programming problems. The first problem defines an objective function z and constraints on variables x1 and x2. The simplex method is used to solve for the optimal values of x1 and x2. The second problem defines another objective function z in terms of variables x1, x2, and x3, along with constraints on the variables. Again, the simplex method is applied to solve for the optimal variable values. The third problem formulates yet another linear program with a different objective function and constraints. The simplex method yields the optimal objective value of 14 and optimal variable values of x1=0.5, x3=4

    Copyright:

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

    Deber Lab Io

    Uploaded by

    Martin
    This document contains the formulation and solution steps for several linear programming problems. The first problem defines an objective function z and constraints on variables x1 and x2. The simplex method is used to solve for the optimal values of x1 and x2. The second problem defines another objective function z in terms of variables x1, x2, and x3, along with constraints on the variables. Again, the simplex method is applied to solve for the optimal variable values. The third problem formulates yet another linear program with a different objective function and constraints. The simplex method yields the optimal objective value of 14 and optimal variable values of x1=0.5, x3=4

    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 5

    4.

    6-5
    z=5x1+4x2
    SUJETO A:
    3x1+2x2<=6
    2x1-x2>=6
    x1,x2>=0

    VB EC
    z 1
    S1 2
    R1 3
    z=R1 z-R1=0
    3x1+2x2+S1=6
    2x1-x2-S2+R1=6

    Z X1 X2 S1 R1
    -1 0 0 0 -1
    0 3 2 1 0
    0 2 -1 0 0
    S2 LD
    0 0
    0 6
    -1 6
    4.7-4
    z=x1-7x2+3x3
    S.T
    2x1+x2-x3<=4
    4x1-3x2<=2
    -3x1+2x2+x3<=3

    VB EC Z X1 X2 X3 X4
    Z 0 1 -1 7 -3 0
    1 X4 1 0 2 1 -1 1
    X5 2 0 4 -3 0 0
    X6 3 0 -3 2 1 0

    VB EC Z X1 X2 X3 X4
    Z 0 1 -10 13 0 0
    2 X4 1 0 -1 3 0 1
    X5 2 0 4 -3 0 0
    X3 3 0 -3 2 1 0

    VB EC Z X1 X2 X3 X4
    Z 0 1 0 5,5 0 0
    3 X4 1 0 0 2.25 0 1
    X5 2 0 1 -0.75 0 0
    X3 3 0 0 -0.25 1

    Z=14 X4=7.5 X1=0.5 X3=4.5


    X5 X6 LD
    0 0 0
    0 0 4 -4
    1 0 2 #DIV/0!
    0 1 3 3

    X5 X6 LD
    0 0 9 9
    0 0 7 7
    1 0 2 2
    0 1 3 3

    X5 X6 LD
    2.5 0 14
    0.25 0 7.5
    0.25 0 0.5
    0.75 1 4.5

    You might also like