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 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:
Maximize 5000 X1 + 7000X2 + 9000X3
Subject to: X1 + X2 + X3 ≤ 2 (only 2 may be chosen)
25000X1 + 32000X2 + 29000X3 ≤ 62,000 (budget limit)
16 X1 + 14 X2 + 19 X3 ≤ 36 (resource limitation)
all variables = 0 or 1
where X1 = 1 if alternative 1 is selected,0 otherwise
X2 = 1 if alternative 2 is selected,0 otherwise
X3 = 1 if alternative 3 is selected,0 otherwise
The optimal solution is X1 = 0,X2 = 1,X3 = 1
-In Table 10-1,which presents an integer programming problem,using the optimal solution means only two of the alternatives would be selected.How much slack is there in the third constraint?
A) 0
B) 3
C) 33
D) 36
E) None of the above
Correct Answer:
Verified
Q33: We do not have a general method
Q34: A mathematical programming model that permits decision
Q35: An integer programming (maximization)problem was first solved
Q36: In an integer programming problem,if it is
Q37: A goal programming problem had two goals
Q39: A type of integer programming is
A)pure.
B)mixed.
C)zero-one.
D)All of
Q40: Assignment problems solved previously by linear programming
Q41: The concept of "satisficing" is affiliated with
Q42: The overall best solution in a nonlinear
Q43: A goal programming problem had two goals
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents