Example 7.6 Facility Location Models. 7.17.1 | 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | 7.117.27.37.47.57.77.87.97.107.11 Background Information.

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
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.
Example 7.3 Pricing Models | 7.2 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n Suits.
Static Workforce Scheduling Models
Solving LP Problems in a Spreadsheet
Example 2.2 Estimating the Relationship between Price and Demand.
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
Example 5.6 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
1 BIS APPLICATION MANAGEMENT INFORMATION SYSTEM Planning modeling Chapter outline: 1.The basic planning problem 2.The basic pricing problem 3.Nonlinear.
Linear Programming Example 5 Transportation Problem.
Example 14.3 Football Production at the Pigskin Company
Example 4.7 Data Envelopment Analysis (DEA) | 4.2 | 4.3 | 4.4 | 4.5 | Background Information n Consider a group of three hospitals.
Example 6.4 Plant and Warehouse Location Models | 6.2 | 6.3 | 6.5 | 6.6 | Background Information n Huntco produces tomato sauce.
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
Example 12.1 Operations Models: Bidding on Contract.
Example 5.3 More General Logistics Models | 5.2 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 5.5 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 7.1 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Madison.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Nonlinear Pricing Models
Example 4.4 Blending Models.
Example 15.2 Blending Oil Products at Chandler Oil
Example 14.1 Introduction to LP Modeling. 14.1a14.1a | 14.2 | Linear Programming n Linear programming (LP) is a method of spreadsheet optimization.
3 Components for a Spreadsheet Linear Programming Problem There is one cell which can be identified as the Target or Set Cell, the single objective of.
Non-Linear Simultaneous Equations
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
COMPREHENSIVE Excel Tutorial 10 Performing What-If Analyses.
Pg #4-12e, 13-18, 23, 24, 26, 36,
Lab 8 Solver In VBA ► Review – Solver Add-in In Excel ► Solver Add-in In VBA.
Example 16.1 Ordering calendars at Walton Bookstore
Example 7.2 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n We continue.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Example 15.6 Managing Cash Flows at Fun Toys
Integer Programming Models
Example 4.5 Production Process Models | 4.2 | 4.3 | 4.4 | 4.6 | Background Information n Repco produces three drugs, A, B and.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
1 Chapter 4 Planning Models Operations Analysis Using MS Excel.
MBA7020_12.ppt/July 25, 2005/Page 1 Georgia State University - Confidential MBA 7020 Business Analysis Foundations Optimization Modeling July 25, 2005.
Chapter 19: The Solver Re-Visited Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University Name.
Example 15.7 Capital Budgeting at the Tatham Company Integer Programming Models.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
Example A Market Share Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.6 |12.7 | 12.8 | 12.9 | | | | | | |
Example 5.10 Project Scheduling Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10a a Background Information.
Example 3.1a Sensitivity Analysis and Solver Table Add-in.
Setting up Solver Add-in for Excel
A Multiperiod Production Problem
Project Scheduling Models
Part I – Entering Equations
Excel Solver IE 469 Spring 2017.
Microsoft Office Illustrated
Andrew-Carter, Inc. Issue: Due to the economic depression, A-C considers to close one of its 3 plants. The objective is to minimize the Cost. Setup: 1.
Excel Solver IE 469 Spring 2018.
Wyndor Example; Enter data
Excel Solver IE 469 Fall 2018.
Linear Programming Excel Solver.
Part I – Entering Equations
Excel Solver IE 469 Spring 2019.
Presentation transcript:

Example 7.6 Facility Location Models

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Lafferty Company wants to locate a warehouse from which it will ship products to four customers. n The location (in the x-y plane) of the four customers and the number of shipments per year needed by each customer are given in this table. Data for Lafferty Example xyShipments per Year Customer Customer Customer Customer

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information -- continued n All locations are in miles, relative to the point x=0 and y=0. n A single warehouse must be used to service all of the customers. n Lafferty wants to determine the location of the warehouse that minimizes the total distance traveled from the warehouse to the customers.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Solution n For the spreadsheet model we need to keep track of the following: –The x and y coordinates of the warehouse and each customer –The distance between the warehouse and each customer –The total annual distance traveled from the warehouse to customers.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | LAFFERTY.XLS n The model appears on the next slide. n This file can be used to build the model.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 |

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Developing the Model n The model can be formed as follows. –Inputs. Enter the given customer data in the shaded ranges. –Coordinates of warehouse. Enter any trial values in Location range for the x- and y-coordinates of the warehouse. –Distances from warehouse to customers. Calculate the distances from the warehouse to the customers in the Distances range. To do so, recall that the (straight line) distance between the two points ( a,b ) and (c,d ) is Therefore, enter the formula =SQRT((B5-$B$11)^2+(C5-$C$11)^2) in cell B14 and copy it to the rest of the Distances range.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Developing the Model -- continued –Total annual distance. The total annual distance traveled from the warehouse to meet the demands of all customers is where n i is the number of trips per year for customer i and d i is the distance from the warehouse to customer i. Therefore, calculate the total annual distance traveled from the customers to the warehouse in the TotDistance cell with the formula =SUMPRODUCT(Shipments,Distances).

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Using the Solver n This model requires the “leanest” Solver setup so far. n All we need to specify is that TotDistance should be minimized and the Location range contains the changing cells. n There are no constraints, not even nonnegativity constraints. n Also, because of the squares in the straight-line distance formula, this model is nonlinear, so the Assume Linear Model box should not be checked.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Solution n The warehouse should be located at x=9.31 and y=5.03. Each year a total of miles will be traveled annually from the warehouse to the customers. n This solution represents a compromise. On the other hand, Lafferty would like to position the facility near customer 4 because customer 4 is fairly far from the other customers, the warehouse is located in a more central position.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Sensitivity Analysis n One possible sensitivity analysis is to see how the optimal location of the warehouse changes as the annual number of shipments to any particular customer increases. n We do this for customer 4 in the table on the following slide. n We run SolverTable with the number of shipments to customer 4 as the single input cell, allowing it to vary from 300 to 700 in increments of 50, and we keep track of the total annual distance and the warehouse location coordinates.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Sensitivity Analysis -- continued n As expected, the total annual distance increases as the annual shipments to customer 4 increase. n Also, the warehouse gradually gets closer to customer 4. In fact, when the annual shipments to customer 4 are 600 or above, the optimal location for the warehouse is at customer 4.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Is the Solver Solution Optimal? n The Lafferty model has no constraints. n An NLP with no constraints is called an unconstrained NLP. Therefore, we know that the Solver will find an optimal solution if the objective is a convex function of the x- and y-coordinates of the warehouse. n It can be shown that the annual distance traveled is indeed a convex function of the coordinates of the warehouse.Therefore, we know that the Solver solution is optimal.

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Is the Solver Solution Optimal? - - continued n However, what if you do not know whether the objective is a convex function? n Then the best strategy is to try different starting solutions in the Locations range, run the Solver on each of them, and see whether they all take you to the same solution. n In fact, we have made this easy for you in the LAFFERTY.XLS file. LAFFERTY.XLS

| 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Is the Solver Solution Optimal? - - continued n We have written two short macros that are automated by clicking on buttons. n Click on the left buttons to randomly generate a new starting location. n Then click on the right button to run Solver. n You should find that they always take you to the same solution.