51) Which of the following is a basic assumption of linear programming?
admin
51) Which of the following is a basic
assumption of linear programming?
A) The condition of uncertainty exists.
B) Independence exists for the activities.
C) Proportionality exists in the objective
function and constraints.
D) Divisibility does not exist, allowing
only integer solutions.
E) Solutions or variables may take values
from -? to +?.
52) The condition when there is no
solution that satisfies all the constraints simultaneously is called
A) boundedness.
B) redundancy.
C) optimality.
D) dependency.
E) None of the above
53) If the addition of a constraint to a
linear programming problem does not change the solution, the constraint is said
to be
A) unbounded.
B) non-negative.
C) infeasible.
D) redundant.
E) bounded.
54) Which of the following is not an
assumption of LP?
A) simultaneity
B) certainty
C) proportionality
D) divisibility
E) additivity
55) The difference between the left-hand
side and right-hand side of a less-than-or-equal-to constraint is referred to
as
A) surplus.
B) constraint.
C) slack.
D) shadow price.
E) None of the above
56) The difference between the left-hand
side and right-hand side of a greater-than-or-equal-to constraint is referred
to as
A) surplus.
B) constraint.
C) slack.
D) shadow price.
E) None of the above
57) A constraint with zero slack or
surplus is called a
A) nonbinding constraint.
B) resource constraint.
C) binding constraint.
D) nonlinear constraint.
E) linear constraint.
58) The coefficients of the variables in
the constraint equations that represent the amount of resources needed to
produce one unit of the variable are called
A) technological coefficients.
B) objective coefficients.
C) shadow prices.
D) dual prices.
E) None of the above
59) A constraint with positive slack or
surplus is called a
A) nonbinding constraint.
B) resource constraint.
C) binding constraint.
D) nonlinear constraint.
E) linear constraint.
60) A straight line representing all
non-negative combinations of X1 and X2 for a particular profit level is called a(n)
A) constraint line.
B) objective line.
C) sensitivity line.
D) profit line.
E) isoprofit line.
61) In order for a linear programming
problem to have a unique solution, the solution must exist
A) at the intersection of the
non-negativity constraints.
B) at the intersection of a non-negativity
constraint and a resource constraint.
C) at the intersection of the objective
function and a constraint.
D) at the intersection of two or more
constraints.
E) None of the above
62) In order for a linear programming
problem to have multiple solutions, the solution must exist
A) at the intersection of the
non-negativity constraints.
B) on a non-redundant constraint parallel
to the objective function.
C) at the intersection of the objective
function and a constraint.
D) at the intersection of three or more
constraints.
E) None of the above
63) Consider the following linear
programming problem:
.jpg”>
The maximum possible value for the
objective function is
A) 360.
B) 480.
C) 1520.
D) 1560.
E) None of the above
64) Consider the following linear
programming problem:
.jpg”>
Which of the following points (X,Y) is
feasible?
A) (10,120)
B) (120,10)
C) (30,100)
D) (60,90)
E) None of the above
65) Consider the following linear
programming problem:
.jpg”>
Which of the following points (X,Y) is in
the feasible region?
A) (30,60)
B) (105,5)
C) (0,210)
D) (100,10)
E) None of the above
66) Consider the following linear
programming problem:
.jpg”>
Which of the following points (X,Y) is
feasible?
A) (50,40)
B) (30,50)
C) (60,30)
D) (90,20)
E) None of the above
67) Which of the following is not
an assumption of LP?
A) certainty
B) proportionality
C) divisibility
D) multiplicativity
E) additivity
68) Consider the following linear
programming problem:
.jpg”>
This is a special case of a linear programming
problem in which
A) there is no feasible solution.
B) there is a redundant constraint.
C) there are multiple optimal solutions.
D) this cannot be solved graphically.
E) None of the above
69) Which of the following functions is not
linear?
A) 5X + 3Z
B) 3X + 4Y + Z – 3
C) 2X + 5YZ
D) Z
E) 2X – 5Y + 2Z
70) Which of the following is not
one of the steps in formulating a linear program?
A) Graph the constraints to determine the
feasible region.
B) Define the decision variables.
C) Use the decision variables to write
mathematical expressions for the objective function and the constraints.
D) Identify the objective and the
constraints.
E) Completely understand the managerial
problem being faced.51) Which of the following is a basic
assumption of linear programming?A) The condition of uncertainty exists.B) Independence exists for the activities.C) Proportionality exists in the objective
function and constraints.D) Divisibility does not exist, allowing
only integer solutions.E) Solutions or variables may take values
from -? to +?.52) The condition when there is no
solution that satisfies all the constraints simultaneously is calledA) boundedness.B) redundancy.C) optimality.D) dependency.E) None of the above53) If the addition of a constraint to a
linear programming problem does not change the solution, the constraint is said
to beA) unbounded.B) non-negative.C) infeasible.D) redundant.E) bounded.54) Which of the following is not an
assumption of LP?A) simultaneityB) certaintyC) proportionalityD) divisibilityE) additivity55) The difference between the left-hand
side and right-hand side of a less-than-or-equal-to constraint is referred to
asA) surplus.B) constraint.C) slack.D) shadow price.E) None of the above56) The difference between the left-hand
side and right-hand side of a greater-than-or-equal-to constraint is referred
to asA) surplus.B) constraint.C) slack.D) shadow price.E) None of the above57) A constraint with zero slack or
surplus is called aA) nonbinding constraint.B) resource constraint.C) binding constraint.D) nonlinear constraint.E) linear constraint.58) The coefficients of the variables in
the constraint equations that represent the amount of resources needed to
produce one unit of the variable are calledA) technological coefficients.B) objective coefficients.C) shadow prices.D) dual prices.E) None of the above59) A constraint with positive slack or
surplus is called aA) nonbinding constraint.B) resource constraint.C) binding constraint.D) nonlinear constraint.E) linear constraint.60) A straight line representing all
non-negative combinations of X1 and X2 for a particular profit level is called a(n)A) constraint line.B) objective line.C) sensitivity line.D) profit line.E) isoprofit line.61) In order for a linear programming
problem to have a unique solution, the solution must existA) at the intersection of the
non-negativity constraints.B) at the intersection of a non-negativity
constraint and a resource constraint.C) at the intersection of the objective
function and a constraint.D) at the intersection of two or more
constraints.E) None of the above62) In order for a linear programming
problem to have multiple solutions, the solution must existA) at the intersection of the
non-negativity constraints.B) on a non-redundant constraint parallel
to the objective function.C) at the intersection of the objective
function and a constraint.D) at the intersection of three or more
constraints.E) None of the above63) Consider the following linear
programming problem:.jpg”>The maximum possible value for the
objective function isA) 360.B) 480.C) 1520.D) 1560.E) None of the above64) Consider the following linear
programming problem:.jpg”>Which of the following points (X,Y) is
feasible?A) (10,120)B) (120,10)C) (30,100)D) (60,90)E) None of the above65) Consider the following linear
programming problem:.jpg”>Which of the following points (X,Y) is in
the feasible region?A) (30,60)B) (105,5)C) (0,210)D) (100,10)E) None of the above66) Consider the following linear
programming problem:.jpg”>Which of the following points (X,Y) is
feasible?A) (50,40)B) (30,50)C) (60,30)D) (90,20)E) None of the above67) Which of the following is not
an assumption of LP?A) certaintyB) proportionalityC) divisibilityD) multiplicativityE) additivity68) Consider the following linear
programming problem:.jpg”>This is a special case of a linear programming
problem in whichA) there is no feasible solution.B) there is a redundant constraint.C) there are multiple optimal solutions.D) this cannot be solved graphically.E) None of the above69) Which of the following functions is not
linear?A) 5X + 3ZB) 3X + 4Y + Z – 3C) 2X + 5YZD) ZE) 2X – 5Y + 2Z70) Which of the following is not
one of the steps in formulating a linear program?A) Graph the constraints to determine the
feasible region.B) Define the decision variables.C) Use the decision variables to write
mathematical expressions for the objective function and the constraints.D) Identify the objective and the
constraints.E) Completely understand the managerial
problem being faced.
