Scribd Logo
Upload

Welcome to Scribd!

  • Activ I Dad Simplex

    Uploaded by

    Aidee Flores Flores
    7 views1 page
    This document contains 3 examples of simplex method problems: 1) A maximization problem with objective function Z=4x1+3x2+6x3 and constraints 3x1+x2+3x3<=30, 2x1+2x2+3x3<=40, and x1, x2, x3>=0. 2) A maximization problem with objective function Z=2x1+3x2 and constraints x1+2x2<=4 and x1+x2=3, and non-negativity constraints. 3) A minimization problem with objective function Z=2x1+5x2+3x3 and

    Original Description:

    Original Title

    Activ i Dad 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
    This document contains 3 examples of simplex method problems: 1) A maximization problem with objective function Z=4x1+3x2+6x3 and constraints 3x1+x2+3x3<=30, 2x1+2x2+3x3<=40, and x1, x2, x3>=0. 2) A maximization problem with objective function Z=2x1+3x2 and constraints x1+2x2<=4 and x1+x2=3, and non-negativity constraints. 3) A minimization problem with objective function Z=2x1+5x2+3x3 and

    Copyright:

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

    Activ I Dad Simplex

    Uploaded by

    Aidee Flores Flores
    This document contains 3 examples of simplex method problems: 1) A maximization problem with objective function Z=4x1+3x2+6x3 and constraints 3x1+x2+3x3<=30, 2x1+2x2+3x3<=40, and x1, x2, x3>=0. 2) A maximization problem with objective function Z=2x1+3x2 and constraints x1+2x2<=4 and x1+x2=3, and non-negativity constraints. 3) A minimization problem with objective function Z=2x1+5x2+3x3 and

    Copyright:

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

    SIS 2510 C – ACTIVIDAD SOBRE METODO SIMPLEX

    Docente: Ing. Lucio Salgado Aux: Univ. Carelly Villca Semestre


    2021/2
    1 -. Max Z= 4x 1 + 3x 2 + 6x 3
    c.a.
    3x 1 + x 2 + 3x 3 <= 30
    2x 1 + 2x 2 + 3x 3 <= 40
    x1 , x2 , x 3 >=0

    2- . Max z =2x 1 +3x 2


    c.a: x 1 + 2x 2 <=4
    x1 + x2 = 3

    x 1 ,x 2 >= 0

    3-. Min z =2x 1 +5x 2 +3x 3


    c.a: x 1 - 2x 2 +x 3 >=20
    2x 1 + 4x 2 +x 3 = 50

    x 1 ,x 2 ,x 3 >= 0

    You might also like