Linear Programming Example 5 Transportation Problem.

Slides:



Advertisements
Similar presentations
Network Models Robert Zimmer Room 6, 25 St James.
Advertisements

Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Transportation Assignment and Transshipments Problems
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
Linear Programming Models & Case Studies
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Chapter 10, Part A Distribution and Network Models
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Transportation, Assignment, and Transshipment Problems
Transportation, Transshipment and Assignment Models and Assignment Models.
6-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Transportation, Transshipment, and Assignment Problems Chapter 6.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Solusi Model Transportasi dengan Program Komputer Pertemuan 13 : Mata kuliah : K0164/ Pemrograman Matematika Tahun: 2008.
Linear Programming Network Flow Problems Transportation Assignment Transshipment Production and Inventory.
BA 452 Lesson B.1 Transportation 1 1Review We will spend up to 30 minutes reviewing Exam 1 Know how your answers were graded.Know how your answers were.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
Strategic Allocation of Resources
Example (Transportation Problem)
MT 2351 Chapter 5 Transportation, Assignment, and Transshipment.
Transportation Problems Dr. Ron Tibben-Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding.
1 Lecture 2 MGMT 650 Linear Programming Applications Chapter 4.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming Applications
Linear Programming.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Transportation Model Lecture 16 Dr. Arshad Zaheer
Kerimcan OzcanMNGT 379 Operations Research1 Transportation, Assignment, and Transshipment Problems Chapter 7.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
1 1 Slide Transportation, Assignment, and Transshipment Professor Ahmadi.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
2/7 Transportation LP modeling Turn in homework / Roll call Discussion of homework Transportation modeling Assignment modeling Small group exercise: Transportation.
 Consists of nodes representing a set of origins and a set of destinations.  An arc is used to represent the route from each origins to each destinations.
0 A Toy Production Problem  How many units to produce from each product type in order to maximize the profit? ProductMan-PowerMachineProfit Type A3 h1.
Chapter 7 Transportation, Assignment, and Transshipment Problems
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
作業研究 Using Excel to Formulate and Solve Transportation Problems.
Transportation Problems Dr. Ron Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
Model 2: Transportation Problem Roshnika Fernando.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
DISTRIBUTION AND NETWORK MODELS (1/2)
IE 311 Operations Research– I
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Transportation, Assignment, and Transshipment Problems Pertemuan 7 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Chapter 3 Linear Programming Applications
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 1 Slide Dr. Mohamed Abdel Salam Operations Research (OR) Chapter 8 Transportation, Assignment, and Transshipment Problems.
1 1 Slide Operations Research (OR) Transportation, Assignment, and Transshipment Problems.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Transportation Networks CIVE 744
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
The Transportation Problem: An Introduction
Transportation, Assignment and Network Models
Network Models Robert Zimmer Room 6, 25 St James.
Operations Research (OR)
Chapter 5 Transportation, Assignment, and Transshipment Problems
Slides by John Loucks St. Edward’s University.
Presentation transcript:

Linear Programming Example 5 Transportation Problem

Transportation Problem The transportation problem seeks to minimize the total shipping costs of transporting goods from m origins (each with a supply s i ) to n destinations (each with a demand d j ), when the unit shipping cost from an origin, i, to a destination, j, is c ij. The network representation for a transportation problem with two sources and three destinations is given on the next slide.

Network Representation 2 2 c 11 c 12 c 13 c 21 c 22 c 23 d1d1d1d1 d2d2d2d2 d3d3d3d3 s1s1s1s1 s2s2 SourcesDestinations

LP Formulation The LP formulation in terms of the amounts shipped from the origins to the destinations, x ij, can be written as: Min  c ij x ij i j s.t.  x ij < s i for each origin i j  x ij = d j for each destination j i x ij > 0 for all i and j

Example: Acme Block Co. n Acme Block Company has orders for 80 tons of concrete blocks at three suburban locations as follows: Northwood tons, Westwood tons, and Westwood tons, and Eastwood tons. Eastwood tons. n Acme has two plants, each of which can produce 50 tons per week. n Delivery cost per ton from each plant to each suburban location is shown on the next slide. How should end of week shipments be made to fill the above orders?

n Delivery Cost Per Ton Northwood Westwood Eastwood Northwood Westwood Eastwood Plant Plant Plant Plant Delivery Cost

Decision Variable X 11 : Tons of Concrete shipped from Plan 1 to Northwood X 12 : Tons of Concrete shipped from Plan 1 to Westwood X 13 : Tons of Concrete shipped from Plan 1 to Eastwood X 21 : Tons of Concrete shipped from Plan 2 to Northwood X 22 : Tons of Concrete shipped from Plan 2 to Westwood X 13 : Tons of Concrete shipped from Plan 2 to Eastwood Objective Function Min. 24X X X X X X 23 LP Model

Constraints X 11 + X 12 + X 13 <= 50Plant 1 X 21 + X 22 + X 23 <= 50Plant 2 X 11 +X 21 = 25Northwood X 12 +X 22 = 45Westwood X 13 +X 23 = 10Eastwood Non-Negativity X 11, X 12, X 13, X 21, X 22, X 23 >=0 LP Model

Excel Input

Solver Solution

n Optimal Solution From To Amount Cost From To Amount Cost Plant 1 Northwood Plant 1 Westwood 45 1,350 Plant 1 Westwood 45 1,350 Plant 2 Northwood Plant 2 Northwood Plant 2 Eastwood Plant 2 Eastwood Total Cost = $2,490 Total Cost = $2,490 Solution

n Partial Sensitivity Report (first half) Sensitivity Report

n Partial Sensitivity Report (second half) Sensitivity Report