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 15x1 + 15x2 + 15x3+ 30x4 s.t. 7x1 + 13x2 + 11x3 + 10x4 ≤ 20 {Constraint 1} x1 + x2 + x3 + x4 ≥ 2 {Constraint 2} x1 + x2 ≤ 1 {Constraint 3} x1 + x3 ≥ 1 {Constraint 4} x2 = x4 {Constraint 5} xj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions:   What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section: Chapter Questions
Problem 80P
icon
Related questions
Question
100%

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 15x1 + 15x2 + 15x3+ 30x4
s.t. 7x1 + 13x2 + 11x3 + 10x4 ≤ 20 {Constraint 1}
x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}
x1 + x2 ≤ 1 {Constraint 3}
x1 + x3 ≥ 1 {Constraint 4}
x2 = x4 {Constraint 5}

xj = 1, if location j is selected0, otherwise

Solve this problem to optimality and answer the following questions:
 

  1. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.)
  2. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)
Expert Solution
steps

Step by step

Solved in 5 steps with 4 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

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 15x1 + 25x2 + 15x3+ 35x4
s.t. 8x1 + 11x2 + 6x3 + 6x4 ≤ 17 {Constraint 1}
x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}
x1 + x2 ≤ 1 {Constraint 3}
x1 + x3 ≥ 1 {Constraint 4}
x2 = x4 {Constraint 5}

xj = {1, if location j is selected0, otherwisexj = 1, if location j is selected0, otherwise

Solve this problem to optimality and answer the following questions:
 

  1. Which of the warehouse locations will/will not be selected?

 

 
  1. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.)

 

 
  1. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)

 

 
Solution
Bartleby Expert
SEE SOLUTION
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,