Multiple Choice
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?
A) X2 = X3
B) X2 ≤ X3
C) X2 ≥ X3
D) X2 + X3 = 1
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q22: Define quadratic programming.
Q36: Table 10-5 <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB2951/.jpg" alt="Table 10-5
Q40: Another name for a 0-1 variable is
Q42: Consider the following 0-1 integer programming problem:
Q51: Table 10-1<br>A company has decided to use
Q52: Goal programming permits multiple objectives to be
Q62: A type of integer programming is<br>A)pure.<br>B)mixed.<br>C)zero-one.<br>D)All of
Q64: A goal programming problem had two goals
Q77: Quadratic programming contains squared terms in the
Q97: The concept of "satisficing" is affiliated with