Skip to main content Assignment #3 (Chap. 6 and 7) AnswerSaved Helpopens in a new windowSave &
Fantastic news! We've Found the answer you've been seeking!
Question:
Skip to main contentAssignment #3 (Chap. 6 and 7)
AnswerSaved
Helpopens in a new windowSave & ExitSubmitItem17eBookReferencesItem17
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.
Max35x1+ 25x2+ 15x3+15x4 s.t.4x1+ 12x2+ 6x3+ 7x4 16{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,iflocationjisselected0,otherwisexj=1,iflocationjisselected0,otherwise
Solve this problem to optimality and answer the following questions:
- Which of the warehouse locations will/will not be selected?
- 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.)
PrevQuestion17of21Total17of21Visit question mapNext
Posted Date: