Table 10-4
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 if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred (i.e., it is impossible to build one-half of a factory) . The integer programming model is as follows:
-Table 10-4 presents an integer programming problem. Suppose you wish to add a constraint that stipulates that both alternative 2 and alternative 3 must be selected, or neither can be selected. How would this constraint be written?

Question

Table 10-4
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 if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred (i.e., it is impossible to build one-half of a factory) . The integer programming model is as follows:

-Table 10-4 presents an integer programming problem. Suppose you wish to add a constraint that stipulates that both alternative 2 and alternative 3 must be selected, or neither can be selected. How would this constraint be written?

Quizplus · Accepted Answer

The constraint X₂ = X₃ ensures that both variables are either 0 or 1, meaning both alternatives are selected or neither is selected.

Table 10-4 a Company Has Decided to Use 0−1 Integer Programming to Programming