Scribd Logo
Upload

Welcome to Scribd!

  • Actividad 3 Problemas

    Uploaded by

    mounstruo p
    2 views3 pages
    1) The document presents two optimization problems with constraints and their solutions. The first problem involves minimizing Z = 3v + 4x - 8y subject to three constraints. The optimal solution is Z = 8. 2) The second problem involves minimizing Z = 4X + Y subject to three constraints. The optimal primal-dual solution is presented with X1 = 1/5, X2 = 3/5, S1 = 1/5, S2 = -1/5, A1 = 2/5, A2 = 0, and Z = 17/5. 3) Optimization techniques are applied such as introducing slack variables and applying the simplex method to arrive at the optimal solutions for

    Original Description:

    Original Title

    actividad 3 problemas.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1) The document presents two optimization problems with constraints and their solutions. The first problem involves minimizing Z = 3v + 4x - 8y subject to three constraints. The optimal solution is Z = 8. 2) The second problem involves minimizing Z = 4X + Y subject to three constraints. The optimal primal-dual solution is presented with X1 = 1/5, X2 = 3/5, S1 = 1/5, S2 = -1/5, A1 = 2/5, A2 = 0, and Z = 17/5. 3) Optimization techniques are applied such as introducing slack variables and applying the simplex method to arrive at the optimal solutions for

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    2 views3 pages

    Actividad 3 Problemas

    Uploaded by

    mounstruo p
    1) The document presents two optimization problems with constraints and their solutions. The first problem involves minimizing Z = 3v + 4x - 8y subject to three constraints. The optimal solution is Z = 8. 2) The second problem involves minimizing Z = 4X + Y subject to three constraints. The optimal primal-dual solution is presented with X1 = 1/5, X2 = 3/5, S1 = 1/5, S2 = -1/5, A1 = 2/5, A2 = 0, and Z = 17/5. 3) Optimization techniques are applied such as introducing slack variables and applying the simplex method to arrive at the optimal solutions for

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 3

    20 Julio 2020

    MODELOS DE OPTIMIZACION 1

    ACTIVIDAD 3 (Problema 1 valor 7 pts. Prob.2 valor 8 pts.)

    Problema 1.

    MIN Z = 3v+ 4x- 8y


    Sujeto a: 3v- 4x < ó = 12
    v+ 2x + y > ó =4
    4v- 2x +5y <ó=20
    v,x,y > ó = 0

    MIN Z = 3v+ 4x- 8y +S1-S2 +S3+MA1


    Sujeto a: 3v- 4x +S1 = 12
    v+ 2x + y -S2 +A1 =4
    4v- 2x +5y +S3 =20
    v,x,y > ó = 0

    V. Basicas
    S1=12
    R1=4
    S3=20

    Cb X1 X2 X3 S1 S2 S3 A1 B
    0 S1 3 4 0 1 0 0 0 12
    1 A1 1 2 1 0 -1 0 1 4
    0 S3 4 2 5 0 0 1 0 20
    Z 1 2 1 0 -1 0 0 4

    Cb X1 X2 X3 S1 S2 S3 A1 B
    0 S1 1 0 -2 1 2 0 -2 4
    0 A1 ½ 1 1/2 0 -1/2 0 ½ 2
    0 S3 3 0 4 0 1 1 -1 16
    Z 0 0 0 0 0 0 -1 4
    Cb X1 X2 X3 S1 S2 S3 B
    0 S1 1 0 -2 1 2 0 4
    4 A1 ½ 1 1/2 0 -1/2 0 2
    0 S3 3 0 4 0 1 1 16
    Z -1 0 -6 0 -2 0 8

    La solución óptima es Z=8

    Problema 2.

    MINIMIZAR Z= 4X + Y+0S1+S02+MA1+MA2
    Sujeto a: 3X + Y = 3
    4X + 3Y > ó = 6
    X + 2Y < ó = 4
    X, Y, > ó = 0
    3X + Y + 0S1 + 0S2 + 1A1 + 0A2 = 3
    4X + 3Y - 1S1 + 0S2 + 0A1 + 1A2 = 6
    X + 2Y + 0S1 + 1S2 + 0A1 + 0A2= 4

    CJ 4 1 0 0 + +
    M M
    Cb X1 X2 S1 S2 A1 A2 R
    +M A1 3 1 0 0 1 0 3
    +M A2 4 3 -1 0 0 1 6
    0 S2 1 2 0 1 0 0 4
    Z 7M- 4M- -M 0 0 0 9M
    4 1

    CJ 4 1 0 0 + +
    M M
    Cb X1 X2 S1 S2 A1 A2
    +M X1 1 1/3 0 0 1/3 0
    +M A2 0 5/3 -1 0 -4/3 1
    0 S2 0 5/3 0 1 -1/3 0
    Z 0 5/3M+1/ -M 0 - 0
    3 7/3M+4/3
    CJ 4 1 0 0 + +
    M M
    Cb X1 X2 S1 S2 A1 A2 R
    +M X1 1 0 1/5 0 3/5 -1/5 3/5
    +M X2 0 1 -3/5 0 -4/5 3/5 6/5
    0 S2 0 0 1 1 -1 1 1
    Z 0 0 1/5 0 -M+8/5 -M-1/5 18/5

    CJ 4 1 0 0 + +
    M M
    Cb X1 X2 S1 S2 A1 A2 R
    +M X1 1 0 1/5 0 2/5 0 2/5
    +M X2 0 1 0 3/5 -1/5 0 9/5
    0 S2 0 0 1 1 01 -1 1
    Z 0 0 0 -1/5 -M+7/5 -M 17/5

    La solución óptima es Z=17/5

    You might also like