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

Welcome to Scribd!

  • 22 views

    Sapthagiri College of Engineering, Bangalore. Department of Computer Science and Engineering

    Uploaded by

    Aasim Inamdar
    This document contains a question bank for the Operation Research subject with Module 4 focusing on Transportation and Assignment Problems. It includes 10 questions related to topics like the Hungarian algorithm, transportation problem formulations, assignment problem formulations, finding initial solutions to transportation problems using different methods.

    Copyright:

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

    Sapthagiri College of Engineering, Bangalore. Department of Computer Science and Engineering

    Uploaded by

    Aasim Inamdar
    22 views3 pages
    This document contains a question bank for the Operation Research subject with Module 4 focusing on Transportation and Assignment Problems. It includes 10 questions related to topics like the Hungarian algorithm, transportation problem formulations, assignment problem formulations, finding initial solutions to transportation problems using different methods.

    Original Title

    2nd Ia imp qst

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains a question bank for the Operation Research subject with Module 4 focusing on Transportation and Assignment Problems. It includes 10 questions related to topics like the Hungarian algorithm, transportation problem formulations, assignment problem formulations, finding initial solutions to transportation problems using different methods.

    Copyright:

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

    Sapthagiri College of Engineering, Bangalore. Department of Computer Science and Engineering

    Uploaded by

    Aasim Inamdar
    This document contains a question bank for the Operation Research subject with Module 4 focusing on Transportation and Assignment Problems. It includes 10 questions related to topics like the Hungarian algorithm, transportation problem formulations, assignment problem formulations, finding initial solutions to transportation problems using different methods.

    Copyright:

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

    SAPTHAGIRI COLLEGE OF ENGINEERING, BANGALORE.

    DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING.

    Question Bank

    Sem: VI ‘A’ & ‘B’ Faculty: Shilpa M


    Subject: Operation Research Sub Code: 17CS653

    MODULE-4 : TRANSPORTATION AND ASSIGNMENT PROBLEMS

    1. Explain Hungarian algorithm with example.


    2. Define feasible solution, basic feasible solution, non degenerate solution and optimal solution
    in a transportation problem.
    3. The transportation costs per truck load of cement ( in hundred of rupees) from each plant to
    each project site are as follows:

    Project Site Supply


    1 2 3 4
    F1 2 3 11 7 6
    F2 1 0 6 1 1
    Factorie
    F3 5 8 15 9 10
    s
    Demand 7 5 3 2 17
    Determine the optimal distribution for the company so as to maximize the total transportation
    cost.
    4. A product is produced by 4 factories F1, F2, f3 and F4. Their unit production costs are Rs. 2,
    3, 1 and 5 respectively. Production capacities of the factories are 50, 70, 30 and 50 units
    respectively. The product is supplied to 4 stores S1, S2, S3 and S4, the requirements of which
    are 25, 35, 105 and 20 respectively. Unit costs of transportation are given below.
    Stores

    S1 S2 S3 S4
    F1 2 4 6 11
    Factories
    F2 10 8 7 5
    F3 13 3 9 12
    F4 4 6 8 3

    Find the transportation plan such that the total production and transportation cost is minimum.
    5. The owner of a small machine shop has four machines available to assign for the jobs. Five
    jobs are offered to assign, with the expected profits in hundreds of rupees for machine on
    each job being as follows:
    Job

    1 2 3 4 5
    A 6. 7.8 * 10.1 8.2
    2
    B 7. 8.4 6.5 7.5 6.0
    0
    C 8. 9.2 11.1 7.0 8.2
    Machines 7
    * indicates that machine A D * 6.4 8.7 7.7 8.0 and D cannot perform jobs 3
    and 1 respectively. Find the assignment of jobs to machine that will result in maximum profit.
    6. Find an initial solution to the following transportation problem where the cost matrix is given
    below.

    Destination

    A B C D
    SupplyDemand I 1 5 3 3 34
    7. Find an initial solution to the following transportation
    Origin II 3 3 1 2 1
    problem:
    5
    III 0 2 2 3 1
    2
    I 2 7 2 4 1
    V 9
    21 2 17 27
    5Destination

    Demand D1 D2 D3 D4 D5
    Supply O1 7 6 4 5 9 40
    8. A department has five employees with five jobs to
    Origin O2 8 5 6 7 8 3
    be performed. The time (in hours) each men will
    0
    take to perform each O3 6 8 9 6 5 2 job is given in the
    effectiveness matrix. 0
    O4 5 2 7 8 6 1
    0
    30 30 15 20 5

    Employees
    I II III IV V
    A 10 5 13 15 16
    B 3 9 18 13 6
    C 10 7 2 2 2
    D 7 1 9 7 12
    Job
    1
    s
    E 7 9 10 4 12

    How should the jobs be allocated one per employee, so as to minimize the total man hours. Use
    Hungarian method.
    9. Find an initial basic feasible solution using North West corner rule and Vogel’s
    approximation methods for the following transportation problem.

    1
    30 50 1 7
    9
    0
    7
    30 40 6 9
    0
    0
    8 70 24 18
    0
    0
    8 7 1 5
    4
    10. The MODULE-5: GAME THEORY
    1. Define pay-off?
    2. What is zero sum game?
    3. Explain saddle point?

    You might also like