Scribd Logo
Upload

Welcome to Scribd!

  • Applied Operations Research 1 PDF

    Uploaded by

    Jayaprakasan T
    6 views13 pages
    This document describes an optimization problem involving the allocation of production across multiple factories to meet demand while minimizing costs. It outlines the production capacities and costs of 5 factories, as well as transportation costs between factories and demand locations. The document then describes using a Hungarian method to calculate optimal allocations and reduce imbalances. Penalties are applied to the resulting cost matrix to find a least-cost solution that balances production and demand.

    Original Description:

    Original Title

    Applied Operations Research 1.pdf

    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 describes an optimization problem involving the allocation of production across multiple factories to meet demand while minimizing costs. It outlines the production capacities and costs of 5 factories, as well as transportation costs between factories and demand locations. The document then describes using a Hungarian method to calculate optimal allocations and reduce imbalances. Penalties are applied to the resulting cost matrix to find a least-cost solution that balances production and demand.

    Copyright:

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

    Applied Operations Research 1 PDF

    Uploaded by

    Jayaprakasan T
    This document describes an optimization problem involving the allocation of production across multiple factories to meet demand while minimizing costs. It outlines the production capacities and costs of 5 factories, as well as transportation costs between factories and demand locations. The document then describes using a Hungarian method to calculate optimal allocations and reduce imbalances. Penalties are applied to the resulting cost matrix to find a least-cost solution that balances production and demand.

    Copyright:

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

    paocuet

    paodann
    A, B, c and
    Re and
    R 2,
    lhem

    Theia poducion capashea 50 wnita


    ond
    C dernando
    to
    (W paodues
    29, 35, IO5
    wieh
    Uait helow:
    each

    factaie

    delivei
    extnt tola
    Dele is ston

    ond
    ionspodaon
    pacducon
    odds
    peocduckion cmt to be

    cost Facteny -

    laonaposdakon Facy
    C
    Focoy
    Sactay
    50 unib
    éupply fa ckomy 10
    Facoy
    factoy
    Fackany
    Sto -25
    Demand
    So 2 - 35 ub

    20

    L nadaix
    paoduton cost,
    On
    adding
    becos :

    4
    10

    13
    200
    Denand: 25 (85

    denand Suppy
    damand
    be added eguala
    2 3

    30

    11

    benad 25 5 toS 20 2OO


    VAM Measd
    and
    Nou, penalkea icantifd,
    allo catiOns do
    Peoalies

    22 2 2

    L2o

    2 2

    57 2

    2 1
    3

    llocations olloas:
    The 2

    13

    13

    12
    -4 -2
    2 -2 4
    2
    Vs 2.
    laallocalid New mati. Pltocalid
    li. coat
    method.
    Aduion
    soutoo
    allocaions
    4+5-|
    8
    No.
    I60 +
    901204 O+5504 |6ot
    (Oo
    bor)
    (1Sxo)
    (56vi0)+ (20xg)+ Coot
    (Sxt)+ (26x)+ lRonspoatakon
    Paoduckon
    and
    Cel Evalaon mad .

    12 4

    all med alo catkion, and


    impies ¿teualid.
    be
    (hes ( nai

    Neus alocaon
    es Is 20

    30
    4 13
    lus
    -&

    New alocalid natix. Nes unallocid mi

    2
    2

    -2
    -2
    -7

    4
    cello Huess ia
    Sine
    ilaatioM.

    Paodu chion
    (25*) t (S*6) + (20x8) + C10x (o) +
    Taenpotakon
    (B) (15xI2) + (2oxe) +5x)

    ollocaons

    nto-| A+5-) -8.

    Sine locot'os
    best SolutiDn.
    Ahahars , 2,3,

    These

    +, ,

    Ho aho dd
    he bongalid
    tola)
    1

    12.

    13 12 t4

    18 a

    do.

    balancad
    Hurgaion metod.

    2
    1
    4
    Coima.
    Reduce
    StikaxerotA2.
    andl

    No.
    ntix
    natix
    No
    -1
    be

    2.

    No swkes
    nadn S.

    No. stwkeo nadi, mat


    be

    2
    No

    onde ondnie, cnadix


    be iaaliJ

    xeoea.
    4

    No. tikea

    at kes Oden
    No. be

    condihon

    aasigd.

    2 3

    2
    J
    2.

    Saion

    Saio

    Sation
    slaion
    slaton
    slation

    TotaJ coveud.
    1 I

    lo
    Solve
    dominone method.
    Min.
    2

    2 Maénin
    2
    -5 -5

    -) 2 2

    2 -2 2 2 -2

    2 2 2 Maimay

    Moxiin
    2.

    Maxiio Miina
    sodde point.
    The

    mettod.
    Doainone

    Compaig and
    elinal

    2 2

    1 -5

    2 -2 2 2
    4

    Coonpng and A2. eliinali A4


    B

    2 2 2.

    coluny
    posaibe

    Compon
    2 2.

    2
    9 1

    S 2 -2 2

    Com paing 92
    Conpa

    -S 2

    and
    Coma and

    -5
    A
    Copaing
    Compa average
    2

    (.5
    Eininali

    ellninai A4
    Coaing Corna A and

    Gnal matix, E

    1-¬5)
    2 -[2
    -S

    3-f5)

    slkaligy

    Valw gami
    ((x12)+ (7x2)
    |4
    14

    You might also like