WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 4-5 LP Formulation Example and Excel Solver.

Slides:



Advertisements
Similar presentations
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 20 Network Problems.
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.
Optimization problems using excel solver
Using Solver to solve a minimization LP + interpretation of output BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12.
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Lecture 3 Linear Programming: Tutorial Simplex Method
Understanding optimum solution
Chapter 5 Sensitivity Analysis: An Applied Approach
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 10 Introduction to Sensitivity Analysis.
Ch 3 Introduction to Linear Programming By Kanchala Sudtachat.
Introduction to Linear and Integer Programming
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
Lecture 7: Linear Programming in Excel AGEC 352 Spring 2011 – February 9, 2011 R. Keeney.
Basic Linear Programming Concepts Lecture 2 (4/1/2015)
Sensitivity analysis BSAD 30 Dave Novak
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
INFM 718A / LBSC 705 Information For Decision Making Lecture 4.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Introduction to Nonlinear Programming (NLP)
QM B Linear Programming
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
ISM 206 Lecture 3 The Simplex Method. Announcements Homework due 6pm Thursday Thursday 6pm lecture.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
Linear Programming.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 2 Introduction to Linear Programming.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 1 Introduction to Operations Research.
The application of mathematics and the scientific
Presentation: H. Sarper
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Operations Management
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Linear Programming.
Chapter 6 Supplement Linear Programming.
Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.1 Chapter 12 Planning with linear programming.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Statistical Analysis Other.
Transportation Problems Dr. Ron Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 11 Sensitivity Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 24 Simulation.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.
Gomory Cuts Updated 25 March Example ILP Example taken from “Operations Research: An Introduction” by Hamdy A. Taha (8 th Edition)“Operations Research:
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.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Linear Programming: Formulations, Geometry and Simplex Method Yi Zhang January 21 th, 2010.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Matrix Multiplication The Introduction. Look at the matrix sizes.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 14 Sensitivity Analysis.
Chapter 4 The Simplex Algorithm and Goal Programming
CS4234 Optimiz(s)ation Algorithms L2 – Linear Programming.
Transportation Networks CIVE 744
An Introduction to Linear Programming Pertemuan 4
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
ECEN 460 Power System Operation and Control
Gomory Cuts Updated 25 March 2009.
The application of mathematics and the scientific
Basic Linear Programming Concepts
ECEN 460 Power System Operation and Control
INFM 718A / LBSC 705 Information For Decision Making
Presentation transcript:

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 4-5 LP Formulation Example and Excel Solver

Last Class Introduction to Simplex Algorithm Solving LPs with the Excel Solver Sept 12-14, 2012Wood Saba Vahid2

Thursday Lab Harvest optimization from multiple blocks for log sales Logs categorized by size and quality Different distribution of logs in each block Demand caps for each log quality group Maximum harvest volumes enforced Sept 12-14, 2012Wood Saba Vahid3 Lab 1 Overview

Matrix format vs. Mathematical format each column represents a variable (basic decision variable or secondary ones) Each Row represents a constraint and is named accordingly You should be able to write each row of the LP Matrix as a constraint, using the “columns” as variables. Sept 12-14, 2012Wood Saba Vahid x CB1 + 0 x CB2 + …<= 2,000CB1<= 2, x CB1 + 0 x CB2 + …<= CB1<= 0

Sept 12-14, 2012Wood Saba Vahid5 Feasible Region Example 1 LP Intersection of two binding constraints. Binding constraints are the ones that have reached the value on their RHS.

Example: Lumber and Chip Production Sept 12-14, 2012Wood Saba Vahid6 TB m3 30% Pine 70% Fir $38/m3 TB m3 50% Pine 50% Fir $40/m3 Mill Yard Pine Logs (m3) Fir Logs (m3) Pine lumber (MBF) $245/MBF Fir lumber (MBF) $280/MBF Mill Chips (bdu) $43/bdu Lumber & Chip LP

Next week More LP Modelling examples and concepts Sept 12-14, 2012Wood Saba Vahid7