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.
Chapter5: Network Models
Section5.5: Shortest Path Models
Problem 34P
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,