Enabled: Chapter 7 Using Binary Integer Progr... Saved Help A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 30x1 + 35x2 +15x3+ 20x4 s.t. 12x1 + 8x2 + 5x3 +11x4 s 20 (Constraint 1} x1+ x2 + x3 + x4 2 2 {Constraint 2) x1+ x2 1 {Constraint 3) x1 + x3 2 1{Constraint 4) x2 = x4 {Constraint 5} 1, if location jis selected 0, otherwise Ij = Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will/will not be selected?

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...
icon
Related questions
Question
ng Enabled: Chapter 7 Using Binary Integer Progr... 6
Saved
Help
Se
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm's
goal is to maximize the net present value of their decision while not spending more than their currently available capital.
Max 30x1 + 35x2 + 15x3+ 20x4
s.t. 12x1 + 8x2 + 5x3 + 11x4 s 20 (Constraint 1}
x1+ x2 + x3 + x4 2 {Constraint 2)
x1+ x2 1 {Constraint 3}
x1+ x3 2 1{Constraint 4)
x2 = x4 (Constraint 5}
1, if location j is selected
Ij =
0, otherwise
Solve this problem to optimality and answer the following questions:
a. Which of the warehouse locations will/will not be selected?
Location 1 will
Location 2 will
Location 3 will
Location 4 will
< Prev
5 of 5
Next>
Transcribed Image Text:ng Enabled: Chapter 7 Using Binary Integer Progr... 6 Saved Help Se A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 30x1 + 35x2 + 15x3+ 20x4 s.t. 12x1 + 8x2 + 5x3 + 11x4 s 20 (Constraint 1} x1+ x2 + x3 + x4 2 {Constraint 2) x1+ x2 1 {Constraint 3} x1+ x3 2 1{Constraint 4) x2 = x4 (Constraint 5} 1, if location j is selected Ij = 0, otherwise Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will/will not be selected? Location 1 will Location 2 will Location 3 will Location 4 will < Prev 5 of 5 Next>
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
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…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.