Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
The Best Study Notes
, Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
True / False
1. The LP Relaxation contains the objective function and constraints of the IP problem, but drops all integer restrictions.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.02 - 7.2
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.2 Graphical and Computer Solutions for an All-Integer Linear Program
KEYWORDS: Bloom's: Understand
2. In general, rounding large values of decision variables to the nearest integer value causes fewer problems than rounding
small values.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.02 - 7.2
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.2 Graphical and Computer Solutions for an All-Integer Linear Program
KEYWORDS: Bloom's: Understand
3. If the optimal solution to the LP Relaxation problem is an integer, it is the optimal solution to the integer linear
program.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.02 - 7.2
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.2 Graphical and Computer Solutions for an All-Integer Linear Program
KEYWORDS: Bloom's: Understand
4. Slack and surplus variables are not useful in integer linear programs.
a. True
b. False
, Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
ANSWER: False
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.03 - 7.3
, Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.3 Applications Involving 0-1 Variables
KEYWORDS: Bloom's: Understand
5. A multiple-choice constraint involves selecting k out of n alternatives, where k ≥ 2.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Moderate
LEARNING OBJECTIVES: IMS.ASWC.19.07.04 - 7.4
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.4 Modeling Flexibility Provided by 0-1 Integer Variables
KEYWORDS: Bloom's: Understand
6. In a model involving fixed costs, the 0-1 variable guarantees that the capacity is not available unless the cost has been
incurred.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Moderate
LEARNING OBJECTIVES: IMS.ASWC.19.07.03 - 7.3
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.3 Applications Involving 0-1 Variables
KEYWORDS: Bloom's: Understand
7. If x1 + x2 ≤ 500y1 and y1 is 0-1, then if y1 is 0, x1 and x2 will be 0.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Moderate
LEARNING OBJECTIVES: IMS.ASWC.19.07.03 - 7.3
NATIONAL STANDARDS: United States - BUSPROG: Analytic
TOPICS: 7.3 Applications Involving 0-1 Variables
KEYWORDS: Bloom's: Apply
8. The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.
a. True
Exam Study Guide Latest Updated 2024/2025
The Best Study Notes
, Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
True / False
1. The LP Relaxation contains the objective function and constraints of the IP problem, but drops all integer restrictions.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.02 - 7.2
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.2 Graphical and Computer Solutions for an All-Integer Linear Program
KEYWORDS: Bloom's: Understand
2. In general, rounding large values of decision variables to the nearest integer value causes fewer problems than rounding
small values.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.02 - 7.2
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.2 Graphical and Computer Solutions for an All-Integer Linear Program
KEYWORDS: Bloom's: Understand
3. If the optimal solution to the LP Relaxation problem is an integer, it is the optimal solution to the integer linear
program.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.02 - 7.2
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.2 Graphical and Computer Solutions for an All-Integer Linear Program
KEYWORDS: Bloom's: Understand
4. Slack and surplus variables are not useful in integer linear programs.
a. True
b. False
, Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
ANSWER: False
POINTS: 1
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.07.03 - 7.3
, Chapter 7: Integer Linear Programming.
Exam Study Guide Latest Updated 2024/2025
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.3 Applications Involving 0-1 Variables
KEYWORDS: Bloom's: Understand
5. A multiple-choice constraint involves selecting k out of n alternatives, where k ≥ 2.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Moderate
LEARNING OBJECTIVES: IMS.ASWC.19.07.04 - 7.4
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.4 Modeling Flexibility Provided by 0-1 Integer Variables
KEYWORDS: Bloom's: Understand
6. In a model involving fixed costs, the 0-1 variable guarantees that the capacity is not available unless the cost has been
incurred.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Moderate
LEARNING OBJECTIVES: IMS.ASWC.19.07.03 - 7.3
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 7.3 Applications Involving 0-1 Variables
KEYWORDS: Bloom's: Understand
7. If x1 + x2 ≤ 500y1 and y1 is 0-1, then if y1 is 0, x1 and x2 will be 0.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Moderate
LEARNING OBJECTIVES: IMS.ASWC.19.07.03 - 7.3
NATIONAL STANDARDS: United States - BUSPROG: Analytic
TOPICS: 7.3 Applications Involving 0-1 Variables
KEYWORDS: Bloom's: Apply
8. The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.
a. True
