Canvas

A company has decided to use binary integer programming to help make some investment decisions. There are three possible investment alternatives from which to choose, but if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred lie., it is impossible to build one$-$half of sfoctored. The letterer programing model is as follows:

Maximize

Subject toc

$$0001+70002+90003,$

$x1+x2+x32$ Constraint $1$

$-x1+x20Cd$

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

X$2-1$ if alternative $2$ is selected, $0$ otherwise

X$3-1$ if alternative $3$ is selected, $0$ otherwise

Solution $x1=1,x2=0,x3=1,$ objective value $=14,000.$

The above model presents an integer programming problem. What is the meaning of Constraint $2?$

$$ footh alternutives $1$ and $2$ must be selected.

No more than one alternutice maybe selected.

Dell