Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney.

Slides:



Advertisements
Similar presentations
Logistics & Channel Management
Advertisements

Tier III: Optimization Design Problems Derek McCormack Section 1: Sample Problems.
With Vegetable Farm Example
Lesson 08 Linear Programming
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Planning with Linear Programming
Assignment 2 Question 7 Farmer Leary.
Linear Programming Models & Case Studies
Session II – Introduction to Linear Programming
Chapter 10, Part A Distribution and Network Models
Lecture 13: Transportation ‘Autopower Co. Case’ AGEC 352 Spring 2011 – March 9 R. Keeney.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Lecture 15: Transportation and other Networks AGEC 352 Spring 2012 – March 21 R. Keeney.
Lecture 12: Sensitivity Examples (Shadow Price Interpreted) AGEC 352 Spring 2012 – February 29 R. Keeney.
Chapter 2: Linear Programming Dr. Alaa Sagheer
Systems of Equations Matrix Methods.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
SYSTEMS of EQUATIONS WORD PROBLEMS.
Linear Programming Example 5 Transportation Problem.
Strategic Allocation of Resources
Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney.
Lecture 15: Transportation and other Networks AGEC 352 Spring 2011 – March 23 R. Keeney.
Lecture 17: Network Models/ Inventory Problems AGEC 352 Spring 2011 – March 28 R. Keeney.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Operations Management
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
2.3 Real and nominal wages Actions of employers (buyers) and employees (sellers) determine wages (prices) These prices act as signals or incentives Part.
The Ethanol Project A Feasibility Study Government and Policy.
Corporate Financial Theory
The marketing programme of an organization consists of a number of elements or variables. Marketing mix refers to the culmination of these elements. The.
On LT simulation Game ends at 8:45 p.m.
7 Days. Two days  p590 #2,5,11,13, , 26 NO TI.
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.
Supply Chain Management
COPYRIGHT © 2008 Thomson South-Western, a part of The Thomson Corporation. Thomson, the Star logo, and South-Western are trademarks used herein under license.
Leontief Input-Output Analysis A way to analyze economics of interdependent sectors Case study: Oil and Transportation –Transportation requires gasoline.
CUSTOMER ACCOMODATION
Decision Making Under Risk and Uncertainty: An Overview Lecture II.
November 5, 2012 AGEC 352-R. Keeney.  Recall  With 2000 total units (maximum) at harbor and 2000 units (minimum) demanded at assembly plants it is not.
In The Name Of Allah Lab 07 ins. Tahani Aldweesh.
Futures markets u Today’s price for products to be delivered in the future. u A mechanism of trading promises of future commodity deliveries among traders.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.
Course Overview and Overview of Optimization in Ag Economics Lecture 1.
Feed Grain and Wheat Market Situation And Outlook 2001 Southern Region Agricultural Outlook Conference September 25,2001 Kurt M. Guidry Associate Specialist.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
Lecture 13: Transportation Introduction AGEC 352 Spring 2012 – March 5 R. Keeney.
Rough-Cut Capacity Planning in SCM EIN 5346 Logistics Engineering Fall, 2015.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Rough-Cut Capacity Planning in SCM Theories & Concepts
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
Cost/Return Analysis of Precision Agriculture on Oklahoma Farms Aaron Witt April 25, 2001.
Lecture 13: Transportation Introduction AGEC 352 Fall 2012 – October 24 R. Keeney.
Appendix A with Woodruff Edits Linear Programming Using the Excel Solver Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
Linear Programming Models: Graphical and Computer Methods
Materials Management Intro, Definition, Functions, Objectives, Stages, Factors responsible, Importance.
Engineering Economics (2+0)
Rough-Cut Capacity Planning in SCM Theories & Concepts
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Leontief Input-Output Model
Logarithmic and exponential equations
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Corporate Financial Theory
Logarithmic and exponential equations
Business Logistics Management
Presentation transcript:

Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney

Units in the equations of a model  Setup of the fertilizer mix model and getting the right coefficients.  First step: Identify the units for the activity definitions.  Tons of stock fertilizer (F1, F2, F3, F4)  Second step: Identify the units for the right hand side of constraints.  Tons of nutrient element (Nitrogen etc.)

Units continued  1: Tons of F1  2: Tons of N  How many tons of N are in 1 ton of F1?  The answer to that is the coefficient.  These can be changed but you have to keep everything consistent  1: 100 tons of F1  2: Lbs. of N  How mant lbs. of N are in 100 tons of F1?

Another Example Farm problem focused on corn growing Corn acres planted and harvested ◦ Bushels of corn marketed ◦ Bushels of corn put in storage ◦ Bushels of corn fed to hogs Requires a constraint that converts corn acres harvested to bushels of corn How many bushels are in an acre of corn? ◦ Yield (bushels/acre)

Units and Specification For almost every type of problem units can be an issue One type where it is typically not is the transportation problem General name for any problem where activities are defined by movement of products rather than their production or use.

Transportation coefficients Source supply: 100 units of product ◦ Ship no more than this amount Destination demand: 60 units of product ◦ Ship no less than this amount Activity = ship from source to destination. A unit at the source converts exactly to a unit at the destination, making the coefficient = 1. But is this true?

Commodity Properties Based on final use Form  Products are converted from original to one or more consumable types. Time  Products are inventoried converting them from current to future consumption possibilities. Place  Products are moved converting them to consumption possibilities at another location.

Commodity Properties Based on final use Form  Products are converted from original to one or more consumable types. Time  Products are inventoried converting them from current to future consumption possibilities. Place  Products are moved converting them to consumption possibilities at another location.

Classes of problems Production type model: Basic resources are converted to consumable or saleable products. ◦ Ex. Labor and lumber to make chairs & tables. Blending type model: Basic consumables are blended together to meet requirements. ◦ Ex. Combine fertilizers together to make a new product with different composition.

Models to date have been about form, now we deal with place Company has two plants and three warehouses (all in different locations) ◦ Must transport the output of the plants to the warehouses ◦ Production capacity is limited at each plant ◦ Demand at each warehouse is limited and each warehouse location faces a different price

Transportation Problem Source 1 Source 2 Destination 1 Destination 2 Destination 3 All material must be moved from a source to a destination. Decision variables have two dimensions (from, to) = (source, dest.) Objective coefficients have two dimensions (from, to) = (s,d). Notation P(1,2) = profit per unit from shipping from S1 to D2. X(1,2) = amount moved from shipping from S1 to D2. P(1,2)*X(1,2) = total profit from shipping from S1 to D2. Summing all P*X’s gives total profit for firm.

Matrix Formulation Dest. 1Dest. 2Dest. 3 Source 1X(1,1)X(1,2)X(1,3) Source 2X(2,1)X(2,2)X(2,3) Dest. 1Dest. 2Dest. 3 Source 1P(1,1)P(1,2)P(1,3) Source 2P(2,1)P(2,2)P(2,3) Activities Matrix Objective Coefficient Matrix

Costs and Objective Values Warehouse 1 (12 $ SP) Warehouse 2 (14 $ SP) Warehouse 3 (15$ SP) Plant 1Cost = 8 Profit = 4 Cost = 10 Profit = 4 Cost = 12 Profit = 3 Plant 2Cost = 7 Profit = 5 Cost = 9 Profit = 5 Cost = 11 Profit = 4