Scribd
Upload
5 views9 pages

Chapter 7 - ECONOMIC

Selected LP applications (Transportation)

Uploaded by

Ahmed Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views9 pages

Chapter 7 - ECONOMIC

Selected LP applications (Transportation)

Uploaded by

Ahmed Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

20/02/1443

Operations Research

Selected LP applications
Network Modeling
(Transportation Model)

Network Flow Problem Characteristics


A number of business problems can be
represented graphically as networks.
Network flow problems can be
represented as a collection of nodes
connected by arcs.
There are three types of nodes:
–Supply
–Demand
–Transshipment ‫إعادة الشحن‬

1
20/02/1443

Constraints for Network Flow Problems:


The Balance of Flow Rules

The Transportation Model


 The transportation model is an LP that deals with shipping a
commodity from source to destination ‫وجهة‬.
 The transportation model tries to determine the shipping
routes that minimize the total shipping costs and satisfy the
supply and demand limits.
 The transportation problem is represented by a network:

2
20/02/1443

The Transportation Model


There are m sources and n destinations
‫الوجهات‬, called nodes.
The arcs represent the routes linking the
sources and the destinations.
The transportation cost from source i to
destination j is given by cij
The amount to be shipped is given by xij
The amount of supply at source i is si and
demand at destination j is dj

Transportation Model
Network Representation

3
20/02/1443

Transportation Model
LP Formulation
The LP formulation in terms of the amounts shipped
from the origins to the destinations, x ij , can be written
as:

Example 1 (MG Auto Model)


MG Auto has three plants in Los Angeles, Detroit and
New Orleans, and two major distribution centers
(DCs) in Denver and Miami.
The capacities of the three plants during the next
quarter are 1000 , 1500 and 1200 cars. The quarterly
demands at the two DCs are 2300 and 1400 cars.
The mileage/cost chart ($ 0.08 /Mile/Car) between
the plants and the DCs is as follows:

4
20/02/1443

Linear Programming Model?


The solution on the board

Optimal Solution of MG Auto Model

5
20/02/1443

Example 2: Acme Block Company

Delivery Cost Per Ton

The solution on the board

6
20/02/1443

Partial Spreadsheet Showing Optimal Solution

Example 3: Acme Block Company


Two automobile plants linked to 3 main dealers

 Formulate the problem as an LP model


 Solve using Excel sheet.
 Give a Network representation of the solution

7
20/02/1443

Two plants linked to 3 main dealers

The solution on the board

8
20/02/1443

Using Excel sheet

Network representation of the solution

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy