Consider the following binary linear programming formulation of a capital budgeting problem. [begin{array}{ll}text { Max } &
Question:
Consider the following binary linear programming formulation of a capital budgeting problem.
\[\begin{array}{ll}\text { Max } & 1,200 x_{1}+600 x_{2}+950 x_{3}+1,650 x_{4} \\\text { s.t. } & 15,000 x_{1}+20,000 x_{2}+25,000 x_{3} \\& +30,000 x_{4}<=70,000 \\& x_{1}+x_{2}<=1 \\& x_{4}<=x_{3} \\& x_{1}, x_{2}, x_{3}, x_{4}=(0,1)\end{array}\]
Projects \(x_{3}\) and \(x_{4}\) are
a. mutually exclusive.
b. related, where \(x_{3}\) is contingent on \(x_{4}\).
c. related, where \(x_{4}\) is contingent on \(x_{3}\).
d. not related.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Principles Of Engineering Economic Analysis
ISBN: 9781118163832
6th Edition
Authors: John A. White, Kenneth E. Case, David B. Pratt
Question Posted: