Let us consider the case of LaRosa Machine Shop (LMS). LMS is studying where to locate its tool bin facility on the shop floor. The locations of the five production stations appear in the figure below. Y Fabrication Min Paint 1 Station Fabrication Paint Subassembly 1 Subassembly 2 (x, y) = X Y Demand 1 Assembly 4 1 2 2.5 2 35 4 11 Subassembly 1 Subassembly 2 Assembly In an attempt to be fair to the workers in each of the production stations, management has decided to try to find the position of the tool bin that would minimize the sum of the distances from the tool bin to the five production stations. We define the following decision variables. 25 12 6 16 X = horizontal location of the tool bin Y = vertical location of the tool bin We may measure the straight line distance from a station to the tool bin located at (X, Y) by using Euclidean (straight-line) distance. For example, the distance from fabrication located at the coordinates (1, 4) to the tool bin located at the coordinates (X, Y) is given by √(x − 1)² + (Y−4)². (a) Suppose we know the average number of daily trips made to the tool bin from each production station. The average number of trips per day are 11 for fabrication, 25 for Paint, 12 for Subassembly 1, 6 for Subassembly 2, and 16 for Assembly. It seems as though we would want the tool bin closer to those stations with high average numbers of trips. Develop a new unconstrained model that minimizes the sum of the demand-weighted distance defined as the product of the demand (measured in number of trips) and the distance to the station. (b) Solve the model you developed in part (a). (Round your answers to three decimal places.) -(C Comment on the differences between the unweighted distance solution given of X = 2.230 and Y = 3.349 and the demand-weighted solution. The demand-weighted solution shifts the optimal location towards the Paint ✓✓station.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 16EQ
icon
Related questions
Question
Let us consider the case of LaRosa Machine Shop (LMS). LMS is studying where to locate its tool bin facility on the shop floor. The locations of the five production stations appear in the figure below.
Y
5
3
Min
2
Fabrication
1
Station
Paint
Paint Subassembly 1
Fabrication
(x, y) =
Subassembly 1
Subassembly 2
Assembly
Subassembly 2
2
1 4
1
3
X Y Demand
3
2.5 2
4
2
Assembly
5
4
4
11
25
12
6
16
X = horizontal location of the tool bin
Y = vertical location of the tool bin
5
In an attempt to be fair to the workers in each of the production stations, management has decided to try to find the position of the tool bin that would minimize the sum of the distances from the tool bin to the five production
stations. We define the following decision variables.
6
e
We may measure the straight line distance from a station to the tool bin located at (X, Y) by using Euclidean (straight-line) distance. For example, the distance from fabrication located at the coordinates (1, 4) to the tool bin
located at the coordinates (X, Y) is given by √(x - 1)² + (Y4)².
(a) Suppose we know the average number of daily trips made to the tool bin from each production station. The average number of trips per day are 11 for fabrication, 25 for Paint, 12 for Subassembly 1, 6 for Subassembly
2, and 16 for Assembly. It seems as though we would want the tool bin closer to those stations with high average numbers of trips. Develop a new unconstrained model that minimizes the sum of the demand-weighted
distance defined as the product of the demand (measured in number of trips) and the distance to the station.
(b) Solve the model you developed in part (a). (Round your answers to three decimal places.)
= (C
Comment on the differences between the unweighted distance solution given of X = 2.230 and Y = 3.349 and the demand-weighted solution.
The demand-weighted solution shifts the optimal location towards the Paint
station.
Transcribed Image Text:Let us consider the case of LaRosa Machine Shop (LMS). LMS is studying where to locate its tool bin facility on the shop floor. The locations of the five production stations appear in the figure below. Y 5 3 Min 2 Fabrication 1 Station Paint Paint Subassembly 1 Fabrication (x, y) = Subassembly 1 Subassembly 2 Assembly Subassembly 2 2 1 4 1 3 X Y Demand 3 2.5 2 4 2 Assembly 5 4 4 11 25 12 6 16 X = horizontal location of the tool bin Y = vertical location of the tool bin 5 In an attempt to be fair to the workers in each of the production stations, management has decided to try to find the position of the tool bin that would minimize the sum of the distances from the tool bin to the five production stations. We define the following decision variables. 6 e We may measure the straight line distance from a station to the tool bin located at (X, Y) by using Euclidean (straight-line) distance. For example, the distance from fabrication located at the coordinates (1, 4) to the tool bin located at the coordinates (X, Y) is given by √(x - 1)² + (Y4)². (a) Suppose we know the average number of daily trips made to the tool bin from each production station. The average number of trips per day are 11 for fabrication, 25 for Paint, 12 for Subassembly 1, 6 for Subassembly 2, and 16 for Assembly. It seems as though we would want the tool bin closer to those stations with high average numbers of trips. Develop a new unconstrained model that minimizes the sum of the demand-weighted distance defined as the product of the demand (measured in number of trips) and the distance to the station. (b) Solve the model you developed in part (a). (Round your answers to three decimal places.) = (C Comment on the differences between the unweighted distance solution given of X = 2.230 and Y = 3.349 and the demand-weighted solution. The demand-weighted solution shifts the optimal location towards the Paint station.
Expert Solution
steps

Step by step

Solved in 5 steps with 26 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,