Question: A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firms goal is to maximize
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firms goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 20x1 + 30x2 + 10x3 + 15x4 s.t. 5x1 + 7x2 + 12x3 + 11x4 21 {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 selected 0, otherwisexj=1, if location j is selected 0, otherwise Which constraint ensures that the firm will not spend more capital than it has available (assume that each potential location 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
