Question $16$

Table $10-1$

A company has decided $to$ use $0-1$ integer programming $to$ help make some investment decisions. There are three possible investment alternatives from which

$to$ choose, but $ifitis$ decided that a particular alternative $istobe$ selected, the entire cost $of$ that alternative will $be$ incurred $(i.e.,itis$ impossible $to$ build one$-$

half $of$ a factory$).$ The integer programming model $isas$ follows:

Maximize $70001+60002+80003$

Subject $to$: $1+2+x31(only1$ may $be$ chosen$)$

$30000X1+180002+40000X3100,000(budgetlimit)$

$15X1+18X2+15X350(resourcelimitation)$

all variables $=0or1$

where $x1=1if$ alternative $1is$ selected, $0$ otherwise

$x2=1if$ alternative $2is$ selected, $0$ otherwise

$x3=1if$ alternative $3is$ selected, $0$ otherwise

The optimal solution $isx1=0,x2=0,x3=1$

According $to$ Table $10-1,$ which presents $an$ integer programming problem, $if$ the optimal solution $is$ used, what would the value $of$ the objective function $be?$

$13,000$

$8,000$

$21,000$

$15,000$

$(please$ answer straight $to$ the question, sometimes i get answers that are completely relevant :$c)$