Scribd Logo
Upload

Welcome to Scribd!

  • Investigacion de Operacioenes

    Uploaded by

    LOlarcon Ddsaul Fgop
    14 views6 pages
    The document contains two linear programming problems: 1) The first problem maximizes Z=11000x1+9000x2+1000x3 subject to the constraints 10000x1+6000x2+4000x3<=10000. 2) The second problem maximizes Z=15x1+8x2+15x3+17x4+7x5 subject to the constraints 50000x1+25200x2+36000x3+47000x4+12000x5<=50000. Both problems define objective functions to maximize and supply constraints to optimize the variables.

    Original Description:

    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
    The document contains two linear programming problems: 1) The first problem maximizes Z=11000x1+9000x2+1000x3 subject to the constraints 10000x1+6000x2+4000x3<=10000. 2) The second problem maximizes Z=15x1+8x2+15x3+17x4+7x5 subject to the constraints 50000x1+25200x2+36000x3+47000x4+12000x5<=50000. Both problems define objective functions to maximize and supply constraints to optimize the variables.

    Copyright:

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

    Investigacion de Operacioenes

    Uploaded by

    LOlarcon Ddsaul Fgop
    The document contains two linear programming problems: 1) The first problem maximizes Z=11000x1+9000x2+1000x3 subject to the constraints 10000x1+6000x2+4000x3<=10000. 2) The second problem maximizes Z=15x1+8x2+15x3+17x4+7x5 subject to the constraints 50000x1+25200x2+36000x3+47000x4+12000x5<=50000. Both problems define objective functions to maximize and supply constraints to optimize the variables.

    Copyright:

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

    Zmax 11000x1+9000x2+1000x3

    SA= 10000x1+6000x2+4000x3<=10000

    x1
    1
    z 11000
    10000
    1000x1+9000x2+1000x3
    6000x2+4000x3<=10000

    x2 x3
    0 0
    9000 1000 11000
    6000 4000 10000 10000
    Z max 15x1+8x2+15x3+17x4+7x5
    SA= 50000x1+25200x2+36000x3+47000x4+12

    x1 x2
    0 0
    z 15 8
    50 25.2
    5x1+8x2+15x3+17x4+7x5
    25200x2+36000x3+47000x4+12000x5= 50000

    x3 x4 x5
    1 0 1
    15 17 7 22
    36 47 12 48 50 miles
    x1 x2
    0 2.66666667
    Z 2 5
    6 8
    2 1
    5 3
    x3
    18.6666667
    8 162.666667 holgura
    4 96 <= 96 0
    2 40 <= 40 0
    2 45.3333333 <= 60 14.6666667
    JIJIJA

    You might also like