Scribd Logo
Upload

Welcome to Scribd!

  • Cs601 Practice Questions Lecture No 35-37

    Uploaded by

    pieceofpeace41
    3 views2 pages
    The document contains 4 questions related to optimization problems: 1) Find P12 and P22 values for a transportation problem using Vogel's approximation method. 2) Operate the first two steps of the Hungarian method on an assignment model to optimize rows and columns. 3) Solve a minimal assignment problem with costs for 4 jobs and 4 men. 4) Continue solving an optimization problem by applying the next step of the Hungarian method to the given matrix.

    Original Description:

    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
    The document contains 4 questions related to optimization problems: 1) Find P12 and P22 values for a transportation problem using Vogel's approximation method. 2) Operate the first two steps of the Hungarian method on an assignment model to optimize rows and columns. 3) Solve a minimal assignment problem with costs for 4 jobs and 4 men. 4) Continue solving an optimization problem by applying the next step of the Hungarian method to the given matrix.

    Copyright:

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

    Cs601 Practice Questions Lecture No 35-37

    Uploaded by

    pieceofpeace41
    The document contains 4 questions related to optimization problems: 1) Find P12 and P22 values for a transportation problem using Vogel's approximation method. 2) Operate the first two steps of the Hungarian method on an assignment model to optimize rows and columns. 3) Solve a minimal assignment problem with costs for 4 jobs and 4 men. 4) Continue solving an optimization problem by applying the next step of the Hungarian method to the given matrix.

    Copyright:

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

    Question No 1:

    Initial basic feasible solution of a transportation problem using the Vogel’s approximation
    method is given in the following table

    2(5) 7 4
    3 3 1(8)
    5 4(7) 7
    1(2) 6(2) 2(10)

    UV-multiplier process is used to find the optimality condition. Find


    a) P12
    b) P22
    Where Pij=cij-(ui+vj) and suppose u4=0
    Question No 2:
    Operate the first and second step by optimizing the row and column wise the below assignment
    model.

    Man
    Task 1 2 3 4 5
    A 1 3 2 3 6
    B 2 4 3 1 5
    C 5 6 3 4 6
    D 3 1 4 2 2
    E 1 5 6 5 4

    Question No 3:
    Solve the following minimal assignment problem

    Man
    Job 1 2 3 4
    A 12 30 21 15
    B 18 33 9 31
    C 44 25 24 21
    D 23 30 28 14
    Question No 4:

    Do next step by applying Hungarian Method

    0 13 49 0 0 13
    0 35 29 5 10 0
    13 0 63 7 7 0
    47 15 0 20 2 0
    25 0 46 9 4 2
    0 53 50 26 4 20

    You might also like