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

Welcome to Scribd!

  • 03 Ot-1

    Uploaded by

    umang.parmar112597
    15 views15 pages
    This document discusses the transportation problem. It describes a scenario where two bread factories supply three bakeries in a city. It presents the supplies of the factories, demands of the bakeries, and transportation costs. It then provides the mathematical model and formulation of the transportation problem. Finally, it discusses various solution methods like the North-West Corner Method and presents another example of a production-transportation problem.

    Original Description:

    Original Title

    03_OT-1

    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 discusses the transportation problem. It describes a scenario where two bread factories supply three bakeries in a city. It presents the supplies of the factories, demands of the bakeries, and transportation costs. It then provides the mathematical model and formulation of the transportation problem. Finally, it discusses various solution methods like the North-West Corner Method and presents another example of a production-transportation problem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    15 views15 pages

    03 Ot-1

    Uploaded by

    umang.parmar112597
    This document discusses the transportation problem. It describes a scenario where two bread factories supply three bakeries in a city. It presents the supplies of the factories, demands of the bakeries, and transportation costs. It then provides the mathematical model and formulation of the transportation problem. Finally, it discusses various solution methods like the North-West Corner Method and presents another example of a production-transportation problem.

    Copyright:

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

    Department of

    Linear Programming: Information and


    Communication
    Technology
    Unit 4:
    Transportation Problem Transportation
    Problem

    Optimization
    Technique (01CT0501)

    Prof. Nishith Kotak


    Aim of
    Transportation
    Problem
    Aim of
    Transportation
    Problem
    Two bread factories, O1 and O2, make the daily bread in a city.
    The bread is delivered to the three bakeries of the city: D1, D2
    and D3. The supplies of bread factories, the demands of
    bakeries and the per unit transportation costs are displayed in
    the following graph:
    Aim of
    Transportation
    Problem

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    Mathematical
    Model of
    Transportation
    Problem

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    Mathematical
    Model of
    Transportation
    Problem
    Therefore, the structure of matrix A depends on the number of origins and
    the number of destinations of the problem; any transportation problem
    having m origins and n destinations has the same matrix A. This matrix has
    m + n rows and m × n columns.

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    Mathematical
    Model of
    Transportation
    Problem

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    • Formulate the problem and arrange the data in the matrix form

    • Obtain an initial basic feasible solution


    North-West Corner Method,
    Steps for the Least Cost Method, and
    Vogel’s Approximation (or Penalty) Method
    Transportation • Test the initial solution for optimality
    Problem MODI (Modified Distribution) Method

    • Updating the solution

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    Warehouse/ W1 W2 W3 W4 Capacity
    Factory
    F1 19 30 50 10 7
    F2 70 30 40 60 9
    F3 40 8 70 20 18
    North West Requirement 5 8 17 4

    Corner Step 1: Check for Balanced/Unbalanced Transportation Problem


    Method Step 2: Continue allocation of min between demand and supply
    on north west corner
    Step 3: Find initial feasible solution
    Warehouse/ W1 W2 W3 Supply
    Factory
    F1 2 7 5 200
    F2 3 4 2 300
    F3 5 4 7 500
    North West Demand 200 400 400

    Corner
    Method
    Warehouse/ W1 W2 W3 W4 Capacity
    Factory
    F1 3 1 7 4 300
    F2 2 6 5 9 400
    F3 8 3 3 2 500
    North West Requirement 250 350 400 200

    Corner
    Method
    Warehouse/ W1 W2 W3 W4 Capacity
    Factory
    F1 1 1 7 4 300
    F2 2 6 6 8 500
    F3 8 2 7 2 550
    North West Requirement 450 300 400 200

    Corner
    Method
    A company manufactures a type of product in three different
    production plants: P1, P2 and P3. Each of these production plants can
    produce up to 1500 units per month. The company supplies four
    customers who require each 1000, 1200, 1500 and 1000 units per
    month. The company makes a benefit of 110 units for the manufacture
    of each unit of product. The unit transportation costs from each
    production plant to each customer are displayed below:
    Production-
    Transportation
    Problem

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    A company manufactures a type of product in three different production
    plants: P1, P2 and P3. Each of these production plants can produce up to 1500
    units per month. The company supplies four customers who require each 1000,
    1200, 1500 and 1000 units per month. The company makes a benefit of 110
    units for the manufacture of each unit of product. The unit transportation costs
    from each production plant to each customer are displayed below:

    Production-
    Transportation
    Problem

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf
    A company manufactures a type of product in three different production
    plants: P1, P2 and P3. Each of these production plants can produce up to 1500
    units per month. The company supplies four customers who require each 1000,
    1200, 1500 and 1000 units per month. The company makes a benefit of 110
    units for the manufacture of each unit of product. The unit transportation costs
    from each production plant to each customer are displayed below:

    Production-
    Transportation
    Problem

    https://ocw.ehu.eus/pluginfile.php/8163/mod_resource/content/1/5_Transportation.pdf

    You might also like