The university administration would like to add some additional parking locations. To make everyone happy, they would like each building to be within a 5 minute walk of one set of new parking spaces (the spaces will be added in blocks of 10 parking spaces). The university is considering six locations for the new parking spaces, but would like to minimize the overall cost of the project. In addition to the walking time requirement, the university would like to add at least 40 new parking spaces (at least 4 blocks of 10). To help with the decision, the management science department formulated the following linear programming model: Min 350x1 + 355x2 + 400x3+ 435x4 + 400x5 + 480x6 S.t. x₁ + x2 + x5 + x6 ≥ 1 {Residence Hall A constraint} x1 + x2 + x3 ≥ 1 [Residence Hall B constraint} X4 + X5 + X6 1 {Science building constraint} X1 + X4 X5 2 1 {Music building constraint} x2 + x3 + x4 ≥ 1 {Math building constraint} x3 + x4 + x5 2 1 (Business building constraint} x2 + x5 + x6 = 1 {Auditorium constraint} x1 + x4 + x6 ² 1 (Arena constraint} x1 + x2 + x3 + x4 + x5 + X6 ≥ 4 [Total locations constraint} 1, if location j is selected Xj 10, otherwise a. What is the minimum the university can spend and still meet its goals? (Round your answer to the nearest whole number.) Minimum university goals
The university administration would like to add some additional parking locations. To make everyone happy, they would like each building to be within a 5 minute walk of one set of new parking spaces (the spaces will be added in blocks of 10 parking spaces). The university is considering six locations for the new parking spaces, but would like to minimize the overall cost of the project. In addition to the walking time requirement, the university would like to add at least 40 new parking spaces (at least 4 blocks of 10). To help with the decision, the management science department formulated the following linear programming model: Min 350x1 + 355x2 + 400x3+ 435x4 + 400x5 + 480x6 S.t. x₁ + x2 + x5 + x6 ≥ 1 {Residence Hall A constraint} x1 + x2 + x3 ≥ 1 [Residence Hall B constraint} X4 + X5 + X6 1 {Science building constraint} X1 + X4 X5 2 1 {Music building constraint} x2 + x3 + x4 ≥ 1 {Math building constraint} x3 + x4 + x5 2 1 (Business building constraint} x2 + x5 + x6 = 1 {Auditorium constraint} x1 + x4 + x6 ² 1 (Arena constraint} x1 + x2 + x3 + x4 + x5 + X6 ≥ 4 [Total locations constraint} 1, if location j is selected Xj 10, otherwise a. What is the minimum the university can spend and still meet its goals? (Round your answer to the nearest whole number.) Minimum university goals
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
Related questions
Question
Transcribed Image Text:b. Which of the locations will be selected?
Location 1 will
Location 2 will
Location 3 will
Location 4 will
Location 5 will
Location 6 will
Transcribed Image Text:The university administration would like to add some additional parking locations. To make everyone happy, they would
like each building to be within a 5 minute walk of one set of new parking spaces (the spaces will be added in blocks of
10 parking spaces). The university is considering six locations for the new parking spaces, but would like to minimize the
overall cost of the project. In addition to the walking time requirement, the university would like to add at least 40 new
parking spaces (at least 4 blocks of 10). To help with the decision, the management science department formulated the
following linear programming model:
Min 350x₁ + 355x2 + 400x3+ 435x4 + 400x5 + 480x6
S.t. x₁ + x2 + x5 + x6 ≥ 1{Residence Hall A constraint}
x1 + x2 + x3 ≥ 1 {Residence Hall B constraint}
1 {Science building constraint}
X4 + x5 + x6 ≥
x1 + x4 + x5 ≥ 1 {Music building constraint}
x2 + x3 + x4 ≥ 1 {Math building constraint}
x3 + x4 + x5 ≥ 1 {Business building constraint}
x2 + x5 + X6 ≥ 1 {Auditorium constraint}
x1 + x4 + X6 ≥ 1 {Arena constraint}
X1 + X2 + x3 + x4 + x5 + x6 ≥ 4 {Total locations constraint}
♫ 1, if location j is selected
x j 10, otherwise
=
a. What is the minimum the university can spend and still meet its goals? (Round your answer to the nearest whole
number.)
Minimum university goals
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 5 images
Recommended textbooks for you
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.