TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
Saved
Decision variables
Question 1 options:
tell how much or how many of something to produce, invest, purchase, hire, etc.
represent the values of the
constraints. measure the
objective function.
must exist for each constraint.
Question 2 (5 points)
Saved
Slack
Question 2 options:
is the difference between the left and right sides of a constraint.
is the amount by which the left side of a < constraint is smaller than the right side.
is the amount by which the left side of a > constraint is larger than the right side.
non of these alternatives is correct
, TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
Question 3 (5 points)
Saved
To find the optimal solution to a linear programming problem using the graphical method
Question 3 options:
find the feasible point that is the farthest
away from the origin. find the feasible point
that is at the highest location.
find the feasible point that is closest to the origin.
None of the alternatives is correct.
Question 4 (5 points)
Saved
The changes (increase or dicrease) in the value of the objective function per unit increase in a right-
hand side is the
Question 4 options:
, TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
sensitivity value.
shadow price.
constraint coefficient.
slack value.
Question 5 (5 points)
Saved
Whenever all the constraints in a linear program are expressed as equalities, the linear program is said
to be written in
Question 5 options:
standard form.
bounded
form.
feasible
form.
alternative form.
Question 6 (5 points)
, TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
Saved
The amount by which an objective function coefficient can change before a different set of values
for the decision variables becomes optimal is the
Question 6 options:
optimal solution.
dual solution.
range of optimality.
range of feasibility.
Question 7 (5 points)
Saved
The range of feasibility measures
Question 7 options:
the right-hand-side values for which the objective function value will not change.
A+ 100% CORRECT
Saved
Decision variables
Question 1 options:
tell how much or how many of something to produce, invest, purchase, hire, etc.
represent the values of the
constraints. measure the
objective function.
must exist for each constraint.
Question 2 (5 points)
Saved
Slack
Question 2 options:
is the difference between the left and right sides of a constraint.
is the amount by which the left side of a < constraint is smaller than the right side.
is the amount by which the left side of a > constraint is larger than the right side.
non of these alternatives is correct
, TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
Question 3 (5 points)
Saved
To find the optimal solution to a linear programming problem using the graphical method
Question 3 options:
find the feasible point that is the farthest
away from the origin. find the feasible point
that is at the highest location.
find the feasible point that is closest to the origin.
None of the alternatives is correct.
Question 4 (5 points)
Saved
The changes (increase or dicrease) in the value of the objective function per unit increase in a right-
hand side is the
Question 4 options:
, TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
sensitivity value.
shadow price.
constraint coefficient.
slack value.
Question 5 (5 points)
Saved
Whenever all the constraints in a linear program are expressed as equalities, the linear program is said
to be written in
Question 5 options:
standard form.
bounded
form.
feasible
form.
alternative form.
Question 6 (5 points)
, TEST 2 WITH ANSWERS WELL RATED
A+ 100% CORRECT
Saved
The amount by which an objective function coefficient can change before a different set of values
for the decision variables becomes optimal is the
Question 6 options:
optimal solution.
dual solution.
range of optimality.
range of feasibility.
Question 7 (5 points)
Saved
The range of feasibility measures
Question 7 options:
the right-hand-side values for which the objective function value will not change.
