Deck 7: Using binary integer programming to deal withy es-Or-No decisions
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/28
Play
Full screen (f)
Deck 7: Using binary integer programming to deal withy es-Or-No decisions
1
A yes-or-no decision is a mutually exclusive decision if it can be yes only if a certain other yes-or-no decision is yes
False
2
Binary integer programming problems can answer which types of questions?
A)Should a project be undertaken?
B)Should an investment be made?
C)Should a plant be located at a particular location?
D)All of the above
E)None of the above
A)Should a project be undertaken?
B)Should an investment be made?
C)Should a plant be located at a particular location?
D)All of the above
E)None of the above
D
3
A linear programming formulation is not valid for a product mix problem when there are setup costs for initiating production
True
4
Variables whose only possible values are 0 and 1 are called integer variables
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
5
Binary variables are variables whose only possible values are 0 or 1
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
6
A parameter analysis report can be used to perform sensitivity analysis for integer programming problems
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
7
Binary variables are best suited to be the decision variables when dealing with yes-or-no decisions
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
8
An auxiliary binary variable is an additional binary variable that is introduced into a model to represent additional yes-or-no decisions
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
9
A problems where all the variables are binary variables is called a pure BIP problem
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
10
Binary variables can have the following values:
A)0
B)1
C)any integer value
D)a and b only
E)All of the above
A)0
B)1
C)any integer value
D)a and b only
E)All of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
11
The algorithms available for solving BIP problems are much more efficient than those for linear programming which is one of the advantages of formulating problems this way
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
12
If choosing one alternative from a group excludes choosing all of the others then these alternatives are called mutually exclusive
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
13
It is possible to have a constraint in a BIP that excludes the possibility of choosing none of the alternatives available
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
14
The constraint x1 + x2 + x3? ≤ 3 in a BIP represents mutually exclusive alternatives
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
15
The constraint x1 ≤ x2 in a BIP problem means that alternative 2 cannot be selected unless alternative 1 is also selected
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
16
BIP can be used to determine the timing of activities
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
17
A BIP problem considers one yes-or-no decision at a time with the objective of choosing the best alternative
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
18
The Excel sensitivity report can be used to perform sensitivity analysis for integer programming problems
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
19
Binary integer programming problems are those where all the decision variables restricted to integer values are further restricted to be binary variables
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
20
BIP can be used in capital budgeting decisions to determine whether to invest a certain amount
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
21
In a BIP problem with 3 mutually exclusive alternatives,x1 ,x2 ,and x3,the following constraint needs to be added to the formulation:
A)x1 + x2 +x3 ≤ 1
B)x1 + x2 +x3 = 1
C)x1 - x2 -x3 ≤ 1
D)x1 - x2 -x3 = 1
E)None of the above
A)x1 + x2 +x3 ≤ 1
B)x1 + x2 +x3 = 1
C)x1 - x2 -x3 ≤ 1
D)x1 - x2 -x3 = 1
E)None of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
22
In a BIP problem,1 corresponds to a yes decision and 0 to a no decision If project A can be undertaken only if project B is also undertaken then the following constraint needs to be added to the formulation:
A)A + B ≤ 1
B)A + B = 1
C)A ≤ B
D)B ≤ A
E)None of the above
A)A + B ≤ 1
B)A + B = 1
C)A ≤ B
D)B ≤ A
E)None of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
23
In a BIP problem,1 corresponds to a yes decision and 0 to a no decision If there are 4 projects under consideration (A,B,C,and D)and at most 2 can be chosen then the following constraint needs to be added to the formulation:
A)A + B + C + D ≤ 1
B)A + B + C + D ≤ 2
C)A + B + C + D ≤ 4
D)A + B + C + D = 2
E)None of the above
A)A + B + C + D ≤ 1
B)A + B + C + D ≤ 2
C)A + B + C + D ≤ 4
D)A + B + C + D = 2
E)None of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
24
In a BIP problem with 2 mutually exclusive alternatives,x1 and x2,the following constraint needs to be added to the formulation:
A)x1 + x2 ≤ 1
B)x1 + x2 ≥ 1
C)x1 - x2 ≤ 1
D)x1 - x2 = 1
E)None of the above
A)x1 + x2 ≤ 1
B)x1 + x2 ≥ 1
C)x1 - x2 ≤ 1
D)x1 - x2 = 1
E)None of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
25
In a BIP problem,1 corresponds to a yes decision and 0 to a no decision If there are two projects under consideration,A and B,and either both projects will be undertaken or no project will be undertaken,then the following constraint needs to be added to the formulation:
A)A ≤ B
B)A + B ≤ 2
C)A ≥ B
D)A = B
E)None of the above
A)A ≤ B
B)A + B ≤ 2
C)A ≥ B
D)A = B
E)None of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
26
Which of the following techniques or tools can be used to perform sensitivity analysis for an integer programming problem?
A)The sensitivity report
B)Trial-and-error
C)A parameter analysis report
D)All of the above
E)b and c only
A)The sensitivity report
B)Trial-and-error
C)A parameter analysis report
D)All of the above
E)b and c only
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
27
In a BIP problem with 2 mutually exclusive alternatives,x1 and x2,the following constraint needs to be added to the formulation if one alternative must be chosen:
A)x1 + x2 ≤ 1
B)x1 + x2 = 1
C)x1 - x2 ≤ 1
D)x1 - x2 = 1
E)None of the above
A)x1 + x2 ≤ 1
B)x1 + x2 = 1
C)x1 - x2 ≤ 1
D)x1 - x2 = 1
E)None of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck
28
.
Binary integer programming can be used for:
A)capital budgeting
B)site selection
C)scheduling asset divestitures
D)assignments of routes
E)All of the above
Binary integer programming can be used for:
A)capital budgeting
B)site selection
C)scheduling asset divestitures
D)assignments of routes
E)All of the above
Unlock Deck
Unlock for access to all 28 flashcards in this deck.
Unlock Deck
k this deck