Pesquisa Operacional Exemplo de Análise de Sensibilidade no Solver.

Slides:



Advertisements
Similar presentations
Pesquisa Operacional Aplicada à Logística Prof
Advertisements

Chapter 3 Demand and Behavior in Markets. Copyright © 2001 Addison Wesley LongmanSlide 3- 2 Figure 3.1 Optimal Consumption Bundle.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Multicriteria Decision-Making Models
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
UNITED NATIONS Shipment Details Report – January 2006.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Thursday, March 14 Introduction to Network Flows
We need a common denominator to add these fractions.
/4/2010 Box and Whisker Plots Objective: Learn how to read and draw box and whisker plots Starter: Order these numbers.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
$100 $200 $300 $400 $100 $200 $300 $400 $100 $200 $300 $400 $100 $200 $300 $400 $100 $200 $300 $400.
Lecture 2 A Telephone Staffing Problem
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
PP Test Review Sections 6-1 to 6-6
An Application of Linear Programming Lesson 12 The Transportation Model.
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
Linear Programming, A Geometric Approach
Chapter 10, Part B Distribution and Network Models
1 1 Slides by John Loucks St. Edwards University Modifications by A. Asef-Vaziri.
8.6 Linear Programming. Linear Program: a mathematical model representing restrictions on resources using linear inequalities combined with a function.
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
Adding Up In Chunks.
Perfect Competition.
Equal or Not. Equal or Not
Analyzing Genes and Genomes
Essential Cell Biology
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
PSSA Preparation.
Essential Cell Biology
X-box Factoring. X- Box 3-9 Product Sum Factor the x-box way Example: Factor 3x 2 -13x (3)(-10)= x 2x 3x 2 x-5 3x +2.
Energy Generation in Mitochondria and Chlorplasts
Transportation Problem
Production Mix Problem Graphical Solution med lrg Electronics Cabinetry Profit (10,20) (Optimal Product Mix!) Profit.
Quiz Number 2 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit Jose Lopez Rosele Lynn Dave Neal Deyanira Pena Professor Kenneth D. Lawerence New.
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Transportation Problem (TP) and Assignment Problem (AP)
Transportation, Transshipment and Assignment Models and Assignment Models.
Chapter 4 Network Models.
1 Network Models Chapter Introduction A network problem is one that can be represented by... Nodes Arcs Function on Arcs.
1Transportation ModelsLesson 4 LECTURE FOUR Transportation Models.
1 Lecture 3 MGMT 650 Sensitivity Analysis in LP Chapter 3.
Transportation, Transshipment and Assignment Models
Linear Programming Example 5 Transportation Problem.
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.
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Network Models.
Transportation and Transshipment Models
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
The Supply Chain Customer Supplier Manufacturer Distributor
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Operations Management - 6 hh Edition Chapter 11 Supplement Roberta.
作業研究 Using Excel to Formulate and Solve Transportation Problems.
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)
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.
1 Network Models. Context Mathematical programming –Linear programming – Supp to Chap 14 –Integer programming – Network programming – Suppl to Chap 11.
The Transportation Problem: An Introduction
Transportation, Transshipment and Assignment Models
Chapter 5 Transportation, Assignment, and Transshipment Problems
A network problem is one that can be represented by...
Chapter 6 Network Models.
Presentation transcript:

Pesquisa Operacional Exemplo de Análise de Sensibilidade no Solver

2 CARLTON PHARMACEUTICALS Carlton Pharmaceuticals supplies drugs and other medical supplies. It has three plants in: Cleveland, Detroit, Greensboro. It has four distribution centers in: Boston, Richmond, Atlanta, St. Louis. Management at Carlton would like to ship cases of a certain vaccine as economically as possible.

3 Data –Unit shipping cost, supply, and demand Assumptions –Unit shipping costs are constant. –All the shipping occurs simultaneously. –The only transportation considered is between sources and destinations. –Total supply equals total demand. To FromBostonRichmondAtlantaSt. LouisSupply Cleveland $ Detroit Greensboro Demand CARLTON PHARMACEUTICALS

4 CARLTON PHARMACEUTICALS Network presentation

5 Boston Richmond Atlanta St.Louis Destinations Sources Cleveland Detroit Greensboro S 1 =1200 S 2 =1000 S 3 = 800 D 1 =1100 D 2 =400 D 3 =750 D 4 =

6 –The structure of the model is: Minimize Total Shipping Cost ST [Amount shipped from a source]  [Supply at that source] [Amount received at a destination] = [Demand at that destination] –Decision variables X ij = the number of cases shipped from plant i to warehouse j. where: i=1 (Cleveland), 2 (Detroit), 3 (Greensboro) j=1 (Boston), 2 (Richmond), 3 (Atlanta), 4(St.Louis) CARLTON PHARMACEUTICALS – Linear Programming Model

7 Boston Richmond Atlanta St.Louis D 1 =1100 D 2 =400 D 3 =750 D 4 =750 The supply constraints Cleveland S 1 =1200 X11 X12 X13 X14 Supply from Cleveland X11+X12+X13+X14  1200 Detroit S 2 =1000 X21 X22 X23 X24 Supply from Detroit X21+X22+X23+X24  1000 Greensboro S 3 = 800 X31 X32 X33 X34 Supply from Greensboro X31+X32+X33+X34  800

8 CARLTON PHARMACEUTICAL – The complete mathematical model Minimize 35X X X X X X X X X31+15X X X34 ST Supply constraints: X11+X12+X13+X X21+X22+X23+X X31+X32+X33+X34800 Demand constraints: X11+X21+X X12+ X22+X32400 X13+ X23+X33750 X14+X24+X34750 All Xij are nonnegative ======== Total shipment out of a supply node cannot exceed the supply at the node. Total shipment received at a destination node, must equal the demand at that node.

9 CARLTON PHARMACEUTICALS Spreadsheet =SUM(B7:E9) Drag to cells C11:E11 =SUMPRODUCT(B7:E9,B15:E17) =SUM(B7:E7) Drag to cells G8:G9

10 MINIMIZE Total Cost SHIPMENTS Demands are met Supplies are not exceeded CARLTON PHARMACEUTICALS Spreadsheet

11 CARLTON PHARMACEUTICALS Spreadsheet - solution

12 CARLTON PHARMACEUTICALS Sensitivity Report –Reduced costs The unit shipment cost between Cleveland and Atlanta must be reduced by at least $5, before it would become economically feasible to utilize it If this route is used, the total cost will increase by $5 for each case shipped between the two cities.

13 CARLTON PHARMACEUTICALS Sensitivity Report –Allowable Increase/Decrease This is the range of optimality. The unit shipment cost between Cleveland and Boston may increase up to $2 or decrease up to $5 with no change in the current optimal transportation plan.

14 CARLTON PHARMACEUTICALS Sensitivity Report –Shadow prices For the plants, shadow prices convey the cost savings realized for each extra case of vaccine produced. For each additional unit available in Cleveland the total cost reduces by $2.

15 CARLTON PHARMACEUTICALS Sensitivity Report –Shadow prices For the warehouses demand, shadow prices represent the cost savings for less cases being demanded. For each one unit decrease in demanded in Richmond, the total cost decreases by $32. –Allowable Increase/Decrease This is the range of feasibility. The total supply in Cleveland may increase up to $250, but doesn´t may decrease up, with no change in the current optimal transportation plan.