Site MapHelpFeedbackMultiple Choice Quiz
Multiple Choice Quiz
(See related pages)

1
Linear programming is a procedure for constrained optimization.
A)True
B)False
2
Linear programming requires an environment of certainty.
A)True
B)False
3
Linear programming will generate a solution to a problem if a solution exists.
A)True
B)False
4
The solution to a linear programming problem might not lie on the border of the feasible solution space.
A)True
B)False
5
Except for the objective function, all other functions in linear programming are straight lines.
A)True
B)False
6
Graphical solutions are limited to problems that have two constraints.
A)True
B)False
7
A linear programming problem can have more than one optimal solution.
A)True
B)False
8
The solution to a graphical problem can be determined by sliding the objective function and by enumeration.
A)True
B)False
9
As the objective function is moved away from the origin, its value decreases
A)True
B)False
10
A shadow price indicates how much decision variable's value can change without affecting the optimal value of the objective function.
A)True
B)False
11
The range of optimality indicates how much decision variable's value can change without affecting the optimal value of the objective function.
A)True
B)False
12
An optimal solution to an LP problem can always be found at a corner point of the feasible solution space if a problem has a solution.
A)True
B)False
13
A redundant constraint is one that forms a unique border of the feasible solution space.
A)True
B)False
14
Slack relates to a › constraint
A)True
B)False
15
If a constraint has a slack equal to zero, it is referred to as a binding constraint.
A)True
B)False
16
Which one is not an assumption of linear programming models?
A)normality
B)certainty
C)divisibility
D)linearity
E)nonnegativity
17
In a two-variable problem, a solution occurs at
A)the intersection of a binding and a nonbinding constraint.
B)the intersection of two binding constraints.
C)the point where the objective function becomes parallel to a binding constraint.
18
In a typical maximization problem, at least one constraint is this type:
A)‹
B)›
C)=
19
Which objective function is parallel to the constraint 4x + 2y ‹ 10?
A)2x + 4y
B)1x + 2y
C)2x + 1y
D)None of these.
20
The range of feasibility relates to:
A)a decision variable
B)constraint coefficients
C)objective function coefficients
D)the righthand-side value of a constraint
E)none of these
21
The range of optimality relates to:
A)a decision variable
B)constraint coefficients
C)objective function coefficients
D)the righthand-side value of a constraint
E)none of these
22
Which one of these could have a non-zero surplus?
A)An objective function.
B)A binding constraint.
C)An equality constraint.
D)A greater than or equal to constraint.
23
Which type of change does not fall into the category of sensitivity analysis?
A)an objective function coefficient
B)the objective
C)a coefficient of a constraint
D)the RHS of a constraint
24
If a change is within the range of feasibility, which of these will change?
A)value of the shadow price
B)value of the objective function
C)list of basic variables
25
If a change is within the range of optimality for a variable that is in solution, which of these will not change?
A)values of the decision variables
B)value of the objective function
C)RHS values of constraints





To learn more about the book this website supports, please visit its Information Center.
Copyright (c)2012 McGraw-Hill Education .
Any use is subject to the Terms of Use and Privacy Notice | Report Piracy


Stevenson OM 11/eOnline Learning Center

Home > Chapter 19 > Multiple Choice Quiz