Scribd Logo
Upload

Welcome to Scribd!

  • Min 4X1

    Uploaded by

    Charles Paredes Saavedra
    126 views4 pages
    This document contains the constraints and objective functions for a linear programming problem with two decision variables (X1 and X2) and constraints including: - Maximize -4X1 - 2X2 - Minimize 4X1 + 2X2 - Subject to the constraints: X1 + 2X2 >= 10, 2X1 + 2X2 >= 10, X1 >= 2 It then provides the sensitivity analysis and feasibility analysis for the optimal solution.

    Original Description:

    Original Title

    MIN 4X1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains the constraints and objective functions for a linear programming problem with two decision variables (X1 and X2) and constraints including: - Maximize -4X1 - 2X2 - Minimize 4X1 + 2X2 - Subject to the constraints: X1 + 2X2 >= 10, 2X1 + 2X2 >= 10, X1 >= 2 It then provides the sensitivity analysis and feasibility analysis for the optimal solution.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    126 views4 pages

    Min 4X1

    Uploaded by

    Charles Paredes Saavedra
    This document contains the constraints and objective functions for a linear programming problem with two decision variables (X1 and X2) and constraints including: - Maximize -4X1 - 2X2 - Minimize 4X1 + 2X2 - Subject to the constraints: X1 + 2X2 >= 10, 2X1 + 2X2 >= 10, X1 >= 2 It then provides the sensitivity analysis and feasibility analysis for the optimal solution.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    MAX -4x1-2X2

    MIN 4X1+2X2
    ST
    X1+2X2 >= 10
    2X1+2X2 >= 10
    X1>=2
    END

    -X1 -2X2 <= -10


    -2X1-2X2 <= -10
    -X1<=-2

    VNB
    VB
    0 S1
    0 S2
    0 S3
    ZJ - CJ

    VNB
    VB
    -2X2
    0 S2
    0 S3
    ZJ - CJ

    VNB
    VB
    -2X2
    0 S2
    -4X1
    ZJ - CJ

    -4
    X1
    -1
    -2
    -1
    4

    -2
    X2
    -2
    -2
    0
    2

    -4
    X1
    -1/2
    -1
    -1
    3

    0
    S1
    -1/2
    -1
    0
    1

    0
    S3
    1/2
    -2
    -1
    3

    0
    S1
    -1
    -1
    0
    1

    LD
    -10
    -10
    -2
    0

    LD
    -5
    0
    -2
    -10

    LD
    4
    2
    2
    -16

    SENSIBILIDAD

    OPTIMALIDAD:

    VNB
    VB
    -2X2
    0 S2
    -4X1
    ZJ - CJ

    0
    S3
    1/2
    -2
    -1
    3

    0
    S1
    -1
    -1
    0
    1

    C2

    C1

    C1
    C2:
    [-2(1/2)+0(1)+ (C1) (-1)]-0 >= 0
    [C2 (1/2)+0(-1) + (-4)(-1)] 0 >=0
    (-1 + 0 C1) 0 >= 0
    [C2/2+4] -0 >= 0
    - C1 >= 1 (-1)
    C1 >= -8
    [-2 (-1) +0 (-1)+C1 (0)]-0 >= 0

    [C2 (-1)+ (0)(-1)+(-4)(0)]-0 >= 0


    -C2 >= 0 (-1)
    C2 <= 0

    LD
    4
    2
    2
    -16

    FACTIBILIDAD

    b1
    [(-1/2) (b1)+ (0) (-10)+ (1/2) (-2)] >= 0
    -1/2(b1) 1 >= 0
    -b1/2 >= 1. (-1)
    b1 <= -2
    [(-1) (b1)+ (1) (-10)+ (-1) (-2)] >= 0
    -b1 -10 + 2 >= 0
    -b1 >= 8 (-1)
    b1 >= -8
    [(0) (b1)+ (0) (-10)+ (-1) (-2)] >= 0

    [(0) (b1)+ (0) (-10)+ (-1) (-2)] >= 0

    b2
    [(-1/2) (-10)+ (0) (b2)+ (1/2) (-2)] >= 0
    [(-1) (-10)+ (1) (b2)+ (-1) (-2)] >= 0
    10 + b2+ 2 >= 0
    b2 >= -12

    b3
    [(-1/2) (-10)+ (0) (-10)+ (1/2) (b3)] >= 0
    5 + b3/2 >= 0
    b3 >= -10
    [(-1) (-10)+ (1) (-10)+ (-1) (b3)] >= 0
    -b3 >= 0
    b3 <= 0
    [(0) (-10)+ (0) (-10)+ (-1) (b3)] >= 0
    -b3 >= 0
    b3 >= 0

    You might also like