Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Find Solution of Assignment Problem Using Hungarian Method-2 (MAX Case)

    Uploaded by

    janak
    The document describes using the Hungarian method to solve an assignment problem with maximization. It involves converting the maximization problem to minimization by subtracting all values from the maximum value. Zero rows are added to make it a balanced problem. Each row and column is adjusted by subtracting the minimum value. An optimal assignment is then made by choosing the minimum value in each row and column.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Find Solution of Assignment Problem Using Hungarian Method-2 (MAX Case)

    Uploaded by

    janak
    40 views3 pages
    The document describes using the Hungarian method to solve an assignment problem with maximization. It involves converting the maximization problem to minimization by subtracting all values from the maximum value. Zero rows are added to make it a balanced problem. Each row and column is adjusted by subtracting the minimum value. An optimal assignment is then made by choosing the minimum value in each row and column.

    Original Title

    29 july 20.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes using the Hungarian method to solve an assignment problem with maximization. It involves converting the maximization problem to minimization by subtracting all values from the maximum value. Zero rows are added to make it a balanced problem. Each row and column is adjusted by subtracting the minimum value. An optimal assignment is then made by choosing the minimum value in each row and column.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    40 views3 pages

    Find Solution of Assignment Problem Using Hungarian Method-2 (MAX Case)

    Uploaded by

    janak
    The document describes using the Hungarian method to solve an assignment problem with maximization. It involves converting the maximization problem to minimization by subtracting all values from the maximum value. Zero rows are added to make it a balanced problem. Each row and column is adjusted by subtracting the minimum value. An optimal assignment is then made by choosing the minimum value in each row and column.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Wednesday, July 29, 2020 11:41 AM

    Find Solution of Assignment problem using


    Hungarian method-2 (MAX case)

    Job
    Work\ 1 2 3 4 5 6 7
    A 5 6 10 16 20 22 24
    B 4 5 8 12 15 18 20
    C 6 8 10 14 16 19 22
    D 7 9 12 15 18 22 24

    Solution:
    The number of rows = 4 and columns = 7

    1 2 3 4 5 6 7
    A 5 6 10 16 20 22 24
    B 4 5 8 12 15 18 20
    C 6 8 10 14 16 19 22
    D 7 9 12 15 18 22 24

    Here the problem is of Maximazition type and convert it


    into minimization by substracting it from maximum value
    24

    New Section 2 Page 1


    1 2 3 4 5 6 7
    A 19 18 14 8 4 2 0
    B 20 19 16 12 9 6 4
    C 18 16 14 10 8 5 2
    D 17 15 12 9 6 2 0

    Here given problem is unbalanced and add 3 new row to


    convert it into a balance.

    1 2 3 4 5 6 7
    A 19 18 14 8 4 2 0
    B 20 19 16 12 9 6 4
    C 18 16 14 10 8 5 2
    D 17 15 12 9 6 2 0
    W5 0 0 0 0 0 0 0
    W6 0 0 0 0 0 0 0
    W7 0 0 0 0 0 0 0

    Step-1: Find out the each row minimum element and


    subtract it from that row

    1 2 3 4 5 6 7
    A 19 18 14 8 4 2 0 (-0)
    B 16 15 12 8 5 2 0 (-4)
    C 16 14 12 8 6 3 0 (-2)
    D 17 15 12 9 6 2 0 (-0)
    W5 0 0 0 0 0 0 0 (-0)
    W6 0 0 0 0 0 0 0 (-0)
    W7 0 0 0 0 0 0 0 (-0)

    Step-2: Find out the each column minimum element


    and subtract it from that column.

    1 2 3 4 5 6 7
    A 19 18 14 8 4 2 0
    B 16 15 12 8 5 2 0
    C 16 14 12 8 6 3 0

    New Section 2 Page 2


    C 16 14 12 8 6 3 0
    D 17 15 12 9 6 2 0
    W5 0 0 0 0 0 0 0
    W6 0 0 0 0 0 0 0
    W7 0 0 0 0 0 0 0
    (-0) (-0) (-0) (-0) (-0) (-0) (-0)

    Step-3: Make an assignment


    1 2 3 4 5 6 7
    A 19 18 14 8 4 2 0
    B 16 15 12 8 5 2 0
    C 16 14 12 8 6 3 0
    D 17 15 12 9 6 2 0
    W5 0 0 0 0 0 0 0
    W6 0 0 0 0 0 0 0
    W7 0 0 0 0 0 0 0

    New Section 2 Page 3

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy