1 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 25x2 + 15x2 + 25x3+ 15x4 s.t 5x1 +11x2 + 4x3 + 5x4 2 [Constraint 2] x1 + x2 > 1 [Constraint 3) *1 + x3 2 1 (Constraint 4) x2 = x4 [Constraint 5) 1, if location jis selected 2 = 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 3 Your employer is trying to select from a list of possible capital projects. The projects, along with their cost and benefits, are listed below. The capital budget available is $1 million. In addition to spending constraints, your employer would like to select at least 2 projects. Projects 5 and 3 cannot both be selected together. Formulate the problem as a linear program and determine the optimal solution. Project 1 2 Cost $255,000 $230,000 $270,000 $250,000 $260,000 Net Present Value $760,000 $670,000 $690,000 $620,000 $780,000 3 4 5 Which projects should be selected? Project 1 will Project 2 will Project 3 will Project 4 will Project 5 will