Question: PLEASE ANSWER THE PROBLEM ASAP. A firm has prepared the following binary integer program to evaluate a number of potential new capital projects. The firm's
PLEASE ANSWER THE PROBLEM ASAP.
A firm has prepared the following binary integer program to evaluate a number of potential new capital projects. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 100x1 + 120x2 + 90x3 + 135x4 s.t. 150x1 + 200x2 + 225x3 + 175x4 500 {Constraint 1} x1 + x2 + x3 + x4 2 {Constraint 2} x2 + x4 1 {Constraint 3} x2 + x3 1 {Constraint 4} x1 = x4 {Constraint 5} xj = { 1, if project j is selected ; 0,otherwise } Which constraint ensures that the firm will not spend more capital than it has available (assume that each potential project has a different cost)?
A. Constraint 1
B.Constraint 2
C.Constraint 3
D.Constraint 4
E.Constraint 5
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
