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

Welcome to Scribd!

  • 54 views

    The Transportation Problems: Exercise 1

    Uploaded by

    Nada Abdel Nasser
    The document contains 11 exercises involving different types of transportation and assignment problems. Exercise 1 involves drawing a transportation network, writing an LP model, and finding initial and optimal solutions. Exercise 2 sets an initial solution and finds the optimal using minimum cost and MODI methods. Exercise 3 finds the minimum transportation cost between mills and customers. Exercises 4-6 modify transportation problem solutions and write LP models. Exercises 7-8 involve transshipment problems, drawing networks and writing models. Exercises 9-11 are assignment problems solved using Hungarian method and written as mathematical models.

    Copyright:

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

    The Transportation Problems: Exercise 1

    Uploaded by

    Nada Abdel Nasser
    54 views4 pages
    The document contains 11 exercises involving different types of transportation and assignment problems. Exercise 1 involves drawing a transportation network, writing an LP model, and finding initial and optimal solutions. Exercise 2 sets an initial solution and finds the optimal using minimum cost and MODI methods. Exercise 3 finds the minimum transportation cost between mills and customers. Exercises 4-6 modify transportation problem solutions and write LP models. Exercises 7-8 involve transshipment problems, drawing networks and writing models. Exercises 9-11 are assignment problems solved using Hungarian method and written as mathematical models.

    Original Title

    Sheet_7

    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 contains 11 exercises involving different types of transportation and assignment problems. Exercise 1 involves drawing a transportation network, writing an LP model, and finding initial and optimal solutions. Exercise 2 sets an initial solution and finds the optimal using minimum cost and MODI methods. Exercise 3 finds the minimum transportation cost between mills and customers. Exercises 4-6 modify transportation problem solutions and write LP models. Exercises 7-8 involve transshipment problems, drawing networks and writing models. Exercises 9-11 are assignment problems solved using Hungarian method and written as mathematical models.

    Copyright:

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

    The Transportation Problems: Exercise 1

    Uploaded by

    Nada Abdel Nasser
    The document contains 11 exercises involving different types of transportation and assignment problems. Exercise 1 involves drawing a transportation network, writing an LP model, and finding initial and optimal solutions. Exercise 2 sets an initial solution and finds the optimal using minimum cost and MODI methods. Exercise 3 finds the minimum transportation cost between mills and customers. Exercises 4-6 modify transportation problem solutions and write LP models. Exercises 7-8 involve transshipment problems, drawing networks and writing models. Exercises 9-11 are assignment problems solved using Hungarian method and written as mathematical models.

    Copyright:

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

    The Transportation Problems

    Exercise 1:
    a. Draw the transportation network for the following problem.
    b. Write the mathematical LP model of the problem.
    c. Find the initial solution using the North-West method, the Min-cost Method, and the Vogel’s
    approximation method.
    d. Starting with the North-west initial solution, find the optimal solution using the MODI method.

    Exercise 2:
    A firm has 3 factories located at A, E, and K which produce the same product. There are four
    major product district centers situated at B, C, D, and M. Average daily product at A, E, and K is
    30, 40, and 50 units respectively. The average daily requirement of this product at B, C, D, and M
    is 35, 28, 32, and 25 units respectively. Set an initial solution for the transportation problem using
    minimum table method to minimize the following equation then find the optimal solution using
    the MODI method, and construct the mathematical model.
    F = 6XAB + 8XAC + 8XAD + 5XAM + 5XEB + 11XEC + 9XED + 7XEM + 8XKB + 9XKC + 7XKD
    + 13XKM
    Exercise 3:
    A steel company has three mills M1, M2, and M3 which can produce 40, 10, and 20 kilotons of
    steel each year. Three customers C1, C2, and C3 have requirements of 12, 18, and 40 kilotons
    respectively in the same period. The cost in units of $ 1000 of transportation a kiloton of steel
    from each mill to each customer is shown in the figure below. Find the minimum transportation
    cost.

    pg. 1
    Exercise 4:
    Is this table, an optimal solution to the following transportation problem starting the initial
    solution by the North-west method?

    50 20
    55
    30 35 25

    1 2 3 4 Availability
    1 6 1 9 3 70
    2 11 5 2 8 55
    3 10 12 4 7 90
    Required 85 35 50 45 215
    If not, modify it to obtain the optimal solution.

    Exercise 5:
    a. Write the mathematical LP model of the problem.
    b. Set an initial solution using the Vogel’s approximation method.
    c. Find the optimal solution using the MODI method.

    Exercise 6:
    Determine the quantities that must be shipped from sources (A, B, C) to satisfy the demands of each
    destination (N, S, E, W) and to minimize the total transportation cost.

    pg. 2
    The Transshipment Problems
    Exercise 7:
    General Ford has two plants, two warehouses, and three customers. The locations of these are as follows:

    Plants: Detroit and Atlanta


    Warehouses: Denver and New York
    Customers: Los Angeles, Chicago, and Philadelphia

    Cars are produced at plants, then shipped to warehouses, and finally shipped to customers. Detroit can
    produce 150 cars per week, and Atlanta can produce 100 cars per week. Los Angeles requires 80 cars per
    week; Chicago, 70; and Philadelphia, 60. It costs $10,000 to produce a car at each plant, and the cost of
    shipping a car between two cities is given in the following table.

    a. Draw the transshipment network of the problem.


    b. Write the mathematical LP model describing the problem.

    Exercise 8:
    For the following transshipment problem:
    a) Draw the network diagram of the problem.
    b) Construct the mathematical model if Memphis and Denver have 150, 200 units available
    respectively, and L.A. and Boston require 130, 220 units.

    pg. 3
    The Assignment Problems
    Exercise 9:
    Machine.co has four machines and four jobs to be completed. Each machine must be assigned to complete
    one job. The time required to set up each machine for completing each job is shown in the following table.
    Machine.co wants to minimize the total setup time needed to complete the four jobs. Use the Hungarian
    method to solve this problem and construct the mathematical model.

    Exercise 10:
    Doc Councilman is putting together a relay team for the 400-meter relay. Each swimmer must swim 100
    meters of breaststroke, backstroke, butterfly, or freestyle. Doc believes that each swimmer will attain
    the times given in the following table. To minimize the team’s time for the race, which swimmer should
    swim which stroke?

    Exercise 11:
    Five employees are available to perform four jobs. The time it takes each person to perform each job is
    given in the table below. Determine the assignment of employees to jobs that minimizes the total time
    required to perform the four jobs. Construct the mathematical model.

    pg. 4

    You might also like