WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.

Slides:



Advertisements
Similar presentations
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 17 Integer Programming.
Advertisements

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 12 Duality Theory.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 15 Forest Planning.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 16 Integer Programming.
Standard Minimization Problems with the Dual
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
Transshipment Problem
LP Examples Solid Waste Management
Assignment (6) Simplex Method for solving LP problems with two variables.
Linear Programming Models & Case Studies
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 10 Introduction to Sensitivity Analysis.
Transportation, Assignment, and Transshipment Problems
Lecture 13: Transportation ‘Autopower Co. Case’ AGEC 352 Spring 2011 – March 9 R. Keeney.
Solusi Model Transportasi dengan Program Komputer Pertemuan 13 : Mata kuliah : K0164/ Pemrograman Matematika Tahun: 2008.
Linear Programming Using the Excel Solver
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Linear Programming Example 5 Transportation Problem.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
Lecture 17: Network Models/ Inventory Problems AGEC 352 Spring 2011 – March 28 R. Keeney.
Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Plant-Location Problem  A new company has won contracts to supply a product to customers in Central America, United States, Europe, and South America.
1 Lecture 2 MGMT 650 Linear Programming Applications Chapter 4.
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming.
LINEAR PROGRAMMING INTRODUCTION
Network Flows Based on the book: Introduction to Management Science. Hillier & Hillier. McGraw-Hill.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 2 Introduction to Linear Programming.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Systems of Equations and Inequalities
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 1 Introduction to Operations Research.
Kerimcan OzcanMNGT 379 Operations Research1 Transportation, Assignment, and Transshipment Problems Chapter 7.
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.
Chapter 7 Transportation, Assignment, and Transshipment Problems
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 4-5 LP Formulation Example and Excel Solver.
In The Name Of Allah Lab 07 ins. Tahani Aldweesh.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 11 Sensitivity Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 18 Branch and Bound Algorithm.
Transportation, Assignment, and Transshipment Problems Pertemuan 7 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
Simplex Method for solving LP problems with two variables.
Chapter 10 Advanced Topics in Linear Programming
LINEAR PROGRAMMING.
Lecture 13: Transportation Introduction AGEC 352 Spring 2012 – March 5 R. Keeney.
Rough-Cut Capacity Planning in SCM EIN 5346 Logistics Engineering Fall, 2015.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
Systems of Inequalities in Two Variables. Graph of an Inequality Systems of Inequalities Linear Programming … and why Linear programming is used in.
Chapter 3 Linear Programming Applications
-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.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 14 Sensitivity Analysis.
Rough-Cut Capacity Planning in SCM Theories & Concepts
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Lecture 13: Transportation Introduction AGEC 352 Fall 2012 – October 24 R. Keeney.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 14, 2011.
Rough-Cut Capacity Planning in SCM Theories & Concepts
Introduction to Linear Programs
Presentation by Team 2.
Linear Programming Wyndor Glass Co. 3 plants 2 new products
The Transportation Problem: An Introduction
Ch 6: Transportation I. Formulation II. Northwest Corner
Linear Programming I: Simplex method
Presentation transcript:

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples

Last Class LP assumptions 2Wood Saba VahidSept 19, 2012

Review: converting equations to matrix form 1.Write the equation with the variables and the appropriate sign (=, ) –e.g. we have a problem with 4 variables (X1 to X4) and a constraint like the following: 15 X1 + X2 – X4 <= Identify the coefficients for each variable 15 X1 + 1 X2 + 0 X3 – 1 X4 <= Insert the coefficient in the row corresponding to the constraint and in the column representing each variable 3Wood Saba VahidSept 19, 2012 Variablex1X2X3x4 Constraint151

Example: US Steel Company Shipping iron ore from the mines, through the storage facilities to the steel plant These types of LP problems are called “transportation” problems 4Wood Saba VahidSept 19, 2012

Example: Cut-Fill areas What is our objective? –Minimize total iron ore transportation costs ($) per month What are our decision variables? –How much ore (tons) to transfer on each route (from mines to storage facilities and then to the plant) each month What are our constraints? –The monthly production capacity of mines (tons) –The monthly demand of the steel plant (tons) –The monthly capacity of the shipping routes (tons) Naming our variables (common in transportation problems): –M1S1: volume of ore (tons) transferred from M1 to S1 per month –S1P: volume of ore (tons) transferred from S1 to steel plant per month US Steel Example 5Wood Saba VahidSept 19, 2012

Lab 2 Preview Three sawmills Three timber harvesting areas One private log source Plan for the next 30 days Maximize profits Supply and demand constraints Sept 19, 2012Wood Saba Vahid6 Lab 2 preview

Next Class More formulation examples Review of the lab Quiz 7Wood Saba VahidSept 19, 2012