Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 108 views

    Assignment 3: Job Man 1 2 3 4 5 I II III IV V

    Uploaded by

    swatiraj05
    1. The Hungarian Assignment method is an algorithm for solving assignment problems. It is more efficient than other methods as it can solve an assignment problem in polynomial time. 2. An unbalanced assignment problem occurs when the number of jobs does not equal the number of workers. The Hungarian method can still be applied by adding dummy jobs or workers to make the numbers equal. 3. The document asks to explain concepts related to game theory including saddle points, pure and mixed strategies, and uses of the minimax criterion to determine best strategies. It then provides several assignment problems to solve involving optimal matching of jobs to workers while minimizing costs.

    Copyright:

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

    Assignment 3: Job Man 1 2 3 4 5 I II III IV V

    Uploaded by

    swatiraj05
    108 views3 pages
    1. The Hungarian Assignment method is an algorithm for solving assignment problems. It is more efficient than other methods as it can solve an assignment problem in polynomial time. 2. An unbalanced assignment problem occurs when the number of jobs does not equal the number of workers. The Hungarian method can still be applied by adding dummy jobs or workers to make the numbers equal. 3. The document asks to explain concepts related to game theory including saddle points, pure and mixed strategies, and uses of the minimax criterion to determine best strategies. It then provides several assignment problems to solve involving optimal matching of jobs to workers while minimizing costs.

    Original Description:

    questions based on assignment

    Original Title

    Assignment 3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The Hungarian Assignment method is an algorithm for solving assignment problems. It is more efficient than other methods as it can solve an assignment problem in polynomial time. 2. An unbalanced assignment problem occurs when the number of jobs does not equal the number of workers. The Hungarian method can still be applied by adding dummy jobs or workers to make the numbers equal. 3. The document asks to explain concepts related to game theory including saddle points, pure and mixed strategies, and uses of the minimax criterion to determine best strategies. It then provides several assignment problems to solve involving optimal matching of jobs to workers while minimizing costs.

    Copyright:

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

    Assignment 3: Job Man 1 2 3 4 5 I II III IV V

    Uploaded by

    swatiraj05
    1. The Hungarian Assignment method is an algorithm for solving assignment problems. It is more efficient than other methods as it can solve an assignment problem in polynomial time. 2. An unbalanced assignment problem occurs when the number of jobs does not equal the number of workers. The Hungarian method can still be applied by adding dummy jobs or workers to make the numbers equal. 3. The document asks to explain concepts related to game theory including saddle points, pure and mixed strategies, and uses of the minimax criterion to determine best strategies. It then provides several assignment problems to solve involving optimal matching of jobs to workers while minimizing costs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    ASSIGNMENT 3

    1. Explain the Hungarian Assignment method. Is it better than other methods of solving assignment problem?
    How?

    2. What is unbalanced assignment problem? How is Hungarian Assignment method applied in respect of such
    a problem?

    3. Explain the following:


    a. Saddle point b. Pure strategy c. Mixed strategy
    4. What is a game in game theory? What are the properties of a game? Explain the best strategy on the
    basis of minimax criterion of optimality.
    5. Solve the following assignment problem:
    Man
    Job
    1 2 3 4 5
    I 12 8 7 15 14
    II 7 9 17 14 10
    III 9 6 12 6 7
    IV 7 6 14 6 10
    V 9 6 12 10 6

    6. Five jobs 1, 2, 3, 4 and 5 are to be assigned to five persons A, B, C, D and E. the time taken (in minutes) by
    each of them on each job is given below:

    1 2 3 4 5

    A 16 13 17 19 20

    B 14 12 13 16 17

    C 14 11 12 17 18

    D 5 5 8 8 11

    E 3 3 8 8 10

    Work out the optimal assignment and the total minimum time taken.

    7. A national truck-rental service has a surplus of one truck in each of the cities 1, 2, 3, 4, 5, 6; and a deficit of
    one truck in each of the cities 7, 8, 9, 10, 11 and 12. The distances (in Kms.) between the cities with a
    surplus and the cities with a deficit are displayed below:
    To
    From
    7 8 9 10 11 12
    1 31 62 29 42 15 41
    2 12 19 39 55 71 40
    3 17 29 50 41 22 22
    4 35 40 38 42 27 33
    5 19 30 29 16 20 23
    6 72 30 30 50 41 20

    How should the trucks be dispersed so as to minimize the total distance travelled?
    8. A department head has six jobs and five subordinates. The subordinates differ in their efficiency and the
    tasks differ in their intrinsic difficulty. The department head estimates the time each man would take to
    perform each task as given in the effectiveness matrix below:
    TASK
    MAN
    A B C D E F
    1 20 15 26 40 32 12
    2 15 32 46 26 28 20
    3 11 15 2 12 6 14
    4 8 24 12 22 22 20
    5 12 20 18 10 22 15
    Only one task can be assigned to one man. Determine how the jobs should be allocated so as to minimize
    the total man-hours. Find the minimum total man-hours.

    9. An airline, operating seven days a week, has given the following schedule of its flights between New Delhi
    and Mumbai. The crews should have a minimum of five hours between the flights. Obtain the pairing of
    flights that minimizes layover time away from home. For any given pairing, the crew will be based at the
    city that results in the smallest layover.
    New Delhi- Mumbai Mumbai-New Delhi

    Flight no. Departure Arrival Flight no. Departure Arrival

    101 5 A.M. 7 A.M. 201 7 A.M. 9 A.M.

    102 7 A.M. 9 A.M. 202 8 A.M. 10 A.M.

    103 1 P.M. 3 P.M. 203 1 P.M. 3 P.M.

    104 7 P.M. 9 P.M. 204 6 P.M. 8 P.M.

    10. Two firms are competing for business under the condition so that one firms gain is another firms loss.
    Firm As payoff matrix is given below:
    Firm B
    Firm A
    No advertising Medium advertising Heavy advertising
    No advertising 10 5 -2
    Medium advertising 13 12 15
    Heavy advertising 16 14 10

    Suggest optimum strategies for the two firms and the net outcome thereof.
    11. Solve the following game:

    Player B
    Player A
    I II III IV
    I 3 2 4 0
    II 3 4 2 4
    III 4 2 4 0
    IV 0 4 0 8
    12. Use the notion of dominance to simplify the rectangular game with the following payoff:
    Player B Player B
    Player Player
    A I II III IV A I II III IV
    I 18 4 6 4 I 1 2 3 -1

    II 6 2 13 7 II 2 2 1 5

    III 11 5 17 3 III 3 1 0 -2
    IV 4 3 2 6
    IV 7 6 12 2

    13. Use graphical method in solving the following game:


    a. b.
    Player B Player B
    Player Player
    2 2 3 -2 A 1 3 -3 7
    A
    4 3 2 6 2 5 4 -6

    C.

    Player B
    1 2
    5 4
    -7 9
    Player A
    -4 -3
    2 1
    d.

    Player B
    -4 3
    -7 1
    -2 -4
    Player A
    -5 -2
    -1 -6

    You might also like