University of Baltimore - MGMT 301 taylo...
University_of_Baltimore_-_MGMT_301_taylor_mgmt-science10_tif_05.doc-Introduction to Management Science, 10e (Taylor)
Showing 5-6 out of 27
University of Baltimore - MGMT 301 taylor mgmt-sci...
University_of_Baltimore_-_MGMT_301_taylor_mgmt-science10_tif_05.doc-Introduction to Management Science, 10e (Taylor)
University of Baltimore - MGMT 301 ...
University_of_Baltimore_-_MGMT_301_taylor_mgmt-science10_tif_05.doc-Introduction to Management Science, 10e (Taylor)
Page 5
25) The solution to the LP relaxation of a minimization integer linear program provides an upper
bound for the value of the objective function.
Answer:
FALSE
Diff: 2
Page Ref: 186
Main Heading:
Integer Programming Models
Key words:
integer programming models, LP relaxation
26) If we perform sensitivity analysis for an integer linear programming problem, we can
provide the same interpretation as we would have obtained from interpreting the corresponding
linear programming problem.
Answer:
FALSE
Diff: 2
Page Ref: 182
Main Heading:
Integer Programming Models
Key words:
integer programming models, sensitivity analysis
27) If we are solving a 0-1 integer programming problem, the constraint
x
1
+
x
2
+
x
3
≤ 3 is a
mutually exclusive constraint.
Answer:
FALSE
Diff: 2
Page Ref: 183
Main Heading:
Integer Programming Models
Key words:
integer linear programming models, 0-1 variables
28) If we are solving a 0-1 integer programming problem, the constraint
x
1
+
x
2
≤ 1 is a mutually
exclusive constraint.
Answer:
TRUE
Diff: 2
Page Ref: 183
Main Heading:
Integer Programming Models
Key words:
integer linear programming models, 0-1 variables
29) If we are solving a 0-1 integer programming problem, the constraint
x
1
+
x
2
= 1 is a
mutually exclusive constraint.
Answer:
FALSE
Diff: 2
Page Ref: 183
Main Heading:
Integer Programming Models
Key words:
0-1 variables, multiple choice constraint
30) If we are solving a 0-1 integer programming problem, the constraint
x
1
x
2
is a mutually
exclusive constraint.
Answer:
FALSE
Diff: 2
Page Ref: 183
Main Heading:
Integer Programming Models
Key words:
0-1 variables, conditional constraints
5


Page 6
31) If we are solving a 0-1 integer programming problem, the constraint
x
1
=
x
2
is a conditional
constraint.
Answer:
FALSE
Diff: 2
Page Ref: 184
Main Heading:
Integer Programming Models
Key words:
0-1 variables, corequisite constraints
32) If we are solving a 0-1 integer programming problem, the constraint
x
1
x
2
is a conditional
constraint.
Answer:
TRUE
Diff: 2
Page Ref: 184
Main Heading:
Integer Programming Models
Key words:
0-1 variables, multiple choice constraint
33) In a __________ linear programming model, some of the solution values for the decision
variables are required to assume integer values and others can be integer or noninteger.
Answer:
mixed integer
Diff: 1
Page Ref: 183
Main Heading:
Integer Programming Models
Key words:
integer programming models, mixed integer programming models
34) In a __________ linear programming model, the solution values of the decision variables are
zero or one.
Answer:
0-1 integer
Diff: 1
Page Ref: 183
Main Heading:
Integer Programming Models
Key words:
integer programming models, 0-1 integer programming models
35) If exactly one investment is to be selected from a set of five investment options, then the
constrain is often called a __________ constraint.
Answer:
multiple-choice
Diff: 2
Page Ref: 184
Main Heading:
Integer Programming Models
Key words:
integer linear programming formulation, capital budgeting
36) If we graph the problem that requires x
1
and x
2
to be an integer, it has a feasible region
consisting of __________.
Answer:
dots
Diff: 3
Page Ref: 187
Main Heading:
Integer Programming Models
Key words:
integer linear programming models, graphical solution
6


Ace your assessments! Get Better Grades
Browse thousands of Study Materials & Solutions from your Favorite Schools
University of Baltimore
University_of_Baltimore
School:
Management_And_Organizational_Behavior
Course:
Great resource for chem class. Had all the past labs and assignments
Leland P.
Santa Clara University
Introducing Study Plan
Using AI Tools to Help you understand and remember your course concepts better and faster than any other resource.
Find the best videos to learn every concept in that course from Youtube and Tiktok without searching.
Save All Relavent Videos & Materials and access anytime and anywhere
Prepare Smart and Guarantee better grades

Students also viewed documents