Question: 10. 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
10. 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)
Projects x3 and x4 are
a. Mutually exclusive
b. x3 is contingent on x4
c. x4 is contingent on x3
d. Not related
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
