Quiz on Linear Programming Models: Graphical and Computer Methods

Managerial Decision Modeling w/ Spreadsheets, 3e (Balakrishnan/Render/Stair)
Chapter 2 Linear Programming Models: Graphical and Computer Methods

2.1 Chapter Questions

1) Consider the following linear programming model:
Max X12 + X2 + 3X3
Subject to: X1 + X2 ≤ 3 X1 + X2 ≤ 1 X1, X2 ≥ 0
This problem violates which of the following assumptions?
A) certainty
B) proportionality
C) divisibility
D) linearity
E) integrality
Answer: D
Page Ref: 22
Topic: Developing a Linear Programming Model
Difficulty: Easy

2) Consider the following linear programming model:
Min 2X1 + 3X2
Subject to: X1 + 2X2 ≤ 1 X2 ≤ 1 X1 ≥ 0, X2 ≤ 0
This problem violates which of the following assumptions?
A) additivity
B) divisibility
C) non-negativity
D) proportionality
E) linearity
Answer: C
Page Ref: 21
Topic: Developing a Linear Programming Model
Difficulty: Easy
3) A redundant constraint is eliminated from a linear programming model. What effect will this have on the optimal solution?
A) feasible region will decrease in size
B) feasible region will increase in size
C) a decrease in objective function value
D) an increase in objective function value
E) no change
Answer: E
Page Ref: 36
Topic: Special Situations in Solving Linear Programming Problems
Difficulty: Moderate

4) Consider the following linear programming model:
Max 2X1 + 3X2
Subject to: X1 ≤ 2 X2 ≤ 3 X1 ≤ 1 X1, X2 ≥ 0
This linear programming model has:
A) alternate optimal solutions
B) unbounded solution
C) redundant constraint
D) infeasible solution
E) non-negative solution
Answer: C
Page Ref: 36
Topic: Special Situations in Solving Linear Programming Problems
Difficulty: Moderate

5) A linear programming model generates an optimal solution with fractional values. This solution satisfies which basic linear programming assumption?
A) certainty
B) divisibility
C) proportionality
D) linearity
E) non-negativity
Answer: B
Page Ref: 22
Topic: Developing a Linear Programming Model
Difficulty: Moderate
6)