61) Table 104 presents a11 integer programming problem. U the opllmal solution is used. then o..'lly n•·o of the
altemati\·es would be seL
octed. How much slack would thtr~ be ln the third constraint?
T~oblc10-5
A) 1000
8) 3000
C)3300
0 ) 8000
E) :'\one of t!>.c
Answer: D
Diff: 2
Topic ~iODEL:XG \\::H 0-1 (BIXAR\") \ "ARIABLES
~"<1•
SubJccttu
abo••
AAC:SB: Analytic Skills
62) Table 10-4 presents an integer programming problem. Suppose you wish to add a eonstratn.t that stipula:es
that both altemati\·e 2 and altematiw 3 must be sekct~ or ne.thtr can be sel«ted. How would this constrain!
be 'h-ritten?
A)X2 = X3
B) X2 :S X3
3Xz• 5XJ • d1· - d1•: 2~
24x1 • JOXz. 32 '(). dz--
dz•;
I Xt • 2 x2 • X) • d 3 - - d 3 •
50
T
()pwDal SolutJoo o-.
SoNIJOD
Decision
GcW
Variable
Value
X~
s
I
ns
2
3
12
Xt
XJ
-
0
1-
C)X2 ~ X3
D)X2+X3 = 1
E) I'\one of the abo\·e
Answer: A
Diff: 2
Topic: MODELD!G WITH 0-1 (BINARY) VARIABLES
AAC:SB: Analytic Skills
t500
d
cr
~OD-
Priority
ac:hie\·ement
I o
f:
25
0
0
'--~-
PI
PI
pl
63) Table 10-5 ~presents a solution to a goal progranuniltg problem. There are three goals (each represented by a
constramt). Wluch goals au only partly achie\·ed?
A) number 1 only
B) number 1 and number 2
C) number 2 and number 3
D) number 1 and number 3
E) !\one of the abo\-e
Answer: A
Diff: 1
Toprc GOAL PROGR.-\.\~!1:\G
AAC:SB: -~)1:lc Slalls
~~ Table 10-5 rcprcsen!S a
sollltion to a goal programming problem. There are three goals (each represented by a
constram1. Goal number 3 ~resents a ~source usage goal. How much of this resource would be used by this
solution?
A 50uruts
8 1;()wuts
c 2500uruts
J l 240uruts
E :\one of the abo\"c
Answ-er: A
Diff: 2
Toprc G0.-\1. PROGR.-\.\~!1:\G
.o\.-\C:SB: Anal)"tle Sblls
16
Copyright© 2012 Pearson Educallon, Inc. publishing as Prentice Hall
17
Cop)"rlght C 2012 Ptarson Education, Inc. publislting as Prentice Hall