11. Consider the following binary linear programming formulation of a capital budgeting problem.

Max 1,200 x1 1 600 x2 1 950 x3 1 1,650 x4 s.t. 15,000 x1 1 20,000 x2 1 25,000 x3 1 30,000 x4 ,5 70,000 x1 1 x2 ,5 1 x4 ,5 x3 x1, x2, x3, x4 5 (0, 1)

The capital budget limit is

a. $90,000

c. $30,000

b. $70,000

d. $4,400