Scribd Logo
Upload

Welcome to Scribd!

  • Factory Warehouse Supply W W W W F F F Demand

    Uploaded by

    Camille Hadap
    7 views4 pages
    The document describes three linear programming problems that aim to minimize costs subject to supply and demand constraints. The problems involve allocating supply from multiple factories and warehouses to meet demand across different locations while respecting capacity limits. The objective is to determine the optimal distribution amounts that minimize total costs.

    Original Description:

    Original Title

    MANSCI.......

    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
    The document describes three linear programming problems that aim to minimize costs subject to supply and demand constraints. The problems involve allocating supply from multiple factories and warehouses to meet demand across different locations while respecting capacity limits. The objective is to determine the optimal distribution amounts that minimize total costs.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views4 pages

    Factory Warehouse Supply W W W W F F F Demand

    Uploaded by

    Camille Hadap
    The document describes three linear programming problems that aim to minimize costs subject to supply and demand constraints. The problems involve allocating supply from multiple factories and warehouses to meet demand across different locations while respecting capacity limits. The objective is to determine the optimal distribution amounts that minimize total costs.

    Copyright:

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

    1.

    Factory Warehouse Supply

    W1 W2 W3 W4

    F1 1 2 1 4 30

    F2 3 3 2 1 50

    F3 4 2 5 9 20

    Demand 20 40 30 10

    Minimize : Z j = x1+ 2xB+ xc + 4xD+3X2A+3X2B +2X2C+X2D +4 X3A+2X3B +5 X3C + 9X3D

    Constraints:

    Subject to:

    X1A + X1B + X1C + X1D= 30

    X2A + X2B + X2C + X2D = 50

    X3A + X3B + X3C + X3D = 20

    X1A + X2A + X3A + 4 A= 20

    X1B + X2B + X3B + X4B= 40

    X1C + X2C + X3C + X3C = 30

    X1D + X2D +X3D +X3D=10

    X ij ≥ 0

    Factory Warehouse Supply

    W1 W2 W3 W4

    F1 1 (20) 2 1 4 ( 30) 10

    F2 3 3 2 1 50

    F3 4 2 5 9 20

    Demand 20 40 30 10
    Factory Warehouse Supply

    W1 W2 W3 W4

    F1 1( 20) 2 (10) 1 4 30

    F2 3 3 (30) 2 (20) 1 50

    F3 4 2 5 (10) 9 ( 10) 20

    Demand 20 40 30 10

    2.

    D1 D2 D3 D4 CAPACITY
    S1 19 30 50 10 7
    S2 70 30 40 60 9
    S3 40 8 70 20 18
    Demand 5 8 14 34

    Minimize : Z j ==19 x1+ 30xB+ 50xc + 10XD+70X2A+30X2B +40X2C+60X2D +40X3A+8X3B +


    70 X3C + 20X3D

    Constraints:

    Subject to:

    X1A + X1B + X1C + X1D= 7

    X2A + X2B + X2C + X2D = 9

    X3A + X3B + X3C + X3D = 18


    X1A + X2A + X3A + 4 A= 5

    X1B + X2B + X3B + X4B= 8

    X1C + X2C + X3C + X3C = 14

    X1D + X2D +X3D +X3D=34

    X ij ≥ 0

    D1 D2 D3 D4 CAPACITY

    S1 19(5) 30 50 10(2) 7
    S2 70 30 40(7) 60(2) 9
    S3 40 8(8) 70 20(10) 18
    Demand 5 8 14 34

    3. Warehouse

    W1 W2 W3 Supply
    F1 16 20 12 200
    F2 14 8 18 160
    F3 26 24 16 90
    Demand 180 120 150 450

    Minimize : Z j ==16x1+ 20xB+ 12xc +14X2A+8X2B +18X2C+26X3A+24X3B +16 X3C

    Constraints:

    Subject to:

    X1A + X1B + X1C=200

    X2A + X2B + X2C= 160

    X3A + X3B + X3C = 90

    X1A + X2A + X3A = 180

    X1B + X2B + X3B = 120

    X1C + X2C + X3C + X3C =150


    X ij ≥ 0

    W1 W2 W3 Supply
    F1 16 20 12 200
    F2 14 8 (120) 18 160
    F3 26 24 16 90
    Demand 180 120 150 450

    W1 W2 W3 Supply
    F1 16( 50) 20 12(150) 200
    F2 14(40) 8 (120) 18 160 (40)
    F3 26(90) 24 16 90
    Demand 180 120 150 450

    You might also like