1. A company makes two products from steel; one requires 2 tons of steel and the other requires 3 tons. There
are 100 tons of steel available daily. A constraint on daily production could be written as: 2x1 + 3x2 ≤ 100.
True
False
2. Let x1 , x2 , and x3 be 0 - 1 variables whose values indicate whether the projects are not done (0) or are done
(1). Which answer below indicates that at least two of the projects must be done?
x1 + x2 + x3 = 2
x1 −x2 = 0
x1 + x2 + x3 ≥ 2
x1 + x2 + x3 ≤ 2
3. The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.
True
False
4. Each point on the efficient frontier graph associated with the Markowitz portfolio model is
the minimum possible risk for the given return.
maximum return for the least risk.
maximum possible risk for the given return.
minimum diversification for the least risk.
5. Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes
before eventually leaving the city. When represented with a network,
None of the alternatives is
correct. the arcs represent one
way streets. the nodes represent
stoplights.
the nodes represent locations where speed limits change.
6. Assuming W1, W2 and W3 are 0 -1 integer variables, the constraint W1 + W2 + W3 < 1 is often called a
multiple-choice constraint.
k out of n alternatives constraint.
mutually exclusive constraint.
corequisite constraint.
are 100 tons of steel available daily. A constraint on daily production could be written as: 2x1 + 3x2 ≤ 100.
True
False
2. Let x1 , x2 , and x3 be 0 - 1 variables whose values indicate whether the projects are not done (0) or are done
(1). Which answer below indicates that at least two of the projects must be done?
x1 + x2 + x3 = 2
x1 −x2 = 0
x1 + x2 + x3 ≥ 2
x1 + x2 + x3 ≤ 2
3. The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.
True
False
4. Each point on the efficient frontier graph associated with the Markowitz portfolio model is
the minimum possible risk for the given return.
maximum return for the least risk.
maximum possible risk for the given return.
minimum diversification for the least risk.
5. Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes
before eventually leaving the city. When represented with a network,
None of the alternatives is
correct. the arcs represent one
way streets. the nodes represent
stoplights.
the nodes represent locations where speed limits change.
6. Assuming W1, W2 and W3 are 0 -1 integer variables, the constraint W1 + W2 + W3 < 1 is often called a
multiple-choice constraint.
k out of n alternatives constraint.
mutually exclusive constraint.
corequisite constraint.
