This preview shows pages 1–3. Sign up to view the full content.
14
Multicriteria Decisions
MULTIPLE CHOICE
1.
A decision with more than one objective
a.
cannot have an optimal solution.
b.
requires the decision maker to place the objectives in some order of importance.
c.
depends on the probability of satisfying each objective.
d.
should be decomposed into a separate model for each objective.
ANSWER:
b
TOPIC:
Introduction
2.
Variables that indicate the distance a target is from the level achieved are called
a.
goal variables.
b.
target variables.
c.
deviation variables.
d.
preemptive variables.
ANSWER:
c
TOPIC:
GP: deviation variables
3.
Preemptive priorities in goal programming
a.
show the target values for the problem.
b.
prevent sacrifice of a goal to satisfy a lower level one.
c.
force the problem to be a standard linear program.
d.
limit deviations to d

only.
ANSWER:
b
TOPIC:
GP: preemptive priorities
4.
Deviation variables that occur in the objective function indicate
a.
the targets.
b.
the priorities.
c.
only the areas that are of concern.
d.
the difference between all actual and target values.
ANSWER:
c
TOPIC:
GP: objective function
5.
The variable d

measures
a.
the amount over the target and is similar to a slack.
b.
the amount under the target and is similar to a slack.
c.
the amount over the target and is similar to a surplus.
d.
the amount under the target and is similar to a surplus.
ANSWER:
b
TOPIC:
GP: deviation variables
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document2
Chapter 14
Multicriteria Decisions
6.
The constraint 5x
1
+ 3x
2
<
150 is modified to become a goal equation, and priority one is to avoid
overutilization.
Which of the following is appropriate?
a.
Min P
1
d
1

;
5x
1
+ 3x
2
+ d
1

 d
1
+
= 150
b.
Min P
1
d
1
+
;
5x
1
+ 3x
2
+ d
1

 d
1
+
= 150
c.
Min P
1
d
1
+
;
5x
1
+ 3x
2
+ d
1
+
= 150
d.
Min P
1
d
1
+
;
5x
1
+ 3x
2
 d
1
+
= 150
ANSWER:
b
TOPIC:
GP: developing the constraints and the goal equations
7.
The goal programming problem with the objective function min P
1
(d
1
+
) +P
2
(d
2

) is initially solved by the
computer and the objective function value is 0.
What constraint should be added for the second problem?
a.
d
1
+
= 0
b.
d
1
+
+ d
2

= 0
c.
d
1
+
+ d
2

= 0
d.
d
1
+
<
0
ANSWER:
a
TOPIC:
GP: developing the constraints and the goal equations
8.
A required step in the analytic hierarchy process is to determine
a.
the goals to be satisfied.
b.
the expected value of the criteria.
c.
the relative importance of a set of features based on a criterion.
d.
how many hierarchies to use.
ANSWER:
c
TOPIC:
AHP: developing the hierarchy
9.
Pairwise comparisons are used to
a.
compare criteria in terms of the overall goal.
b.
compare choices on each criterion.
c.
both a and b are true.
d.
neither a nor b is true.
ANSWER:
c
TOPIC:
AHP: pairwise comparisons
10.
The overall priorities for decision alternatives
a.
are the sum of the products of the criterion priority times the priority of the decision alternative
with respect to that criterion.
b.
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '11
 ElHelbawy

Click to edit the document details