Which of the following is not a part of every linear programming problem formulation?
admin
31) Which of the following is not a
part of every linear programming problem formulation?
A) an objective function
B) a set of constraints
C) non-negativity constraints
D) a redundant constraint
E) maximization or minimization of a
linear function
32) When appropriate, the optimal solution
to a maximization linear programming problem can be found by graphing the
feasible region and
A) finding the profit at every corner
point of the feasible region to see which one gives the highest value.
B) moving the isoprofit lines towards the
origin in a parallel fashion until the last point in the feasible region is
encountered.
C) locating the point that is highest on
the graph.
D) None of the above
E) All of the above
33) The mathematical theory behind linear
programming states that an optimal solution to any problem will lie at a(n)
________ of the feasible region.
A) interior point or center
B) maximum point or minimum point
C) corner point or extreme point
D) interior point or extreme point
E) None of the above
34) Which of the following is not a
property of linear programs?
A) one objective function
B) at least two separate feasible regions
C) alternative courses of action
D) one or more constraints
E) objective function and constraints are
linear
35) The corner point solution method
A) will always provide one, and only one,
optimum.
B) will yield different results from the
isoprofit line solution method.
C) requires that the profit from all
corners of the feasible region be compared.
D) requires that all corners created by
all constraints be compared.
E) will not provide a solution at an
intersection or corner where a non-negativity constraint is involved.
36) When a constraint line bounding a
feasible region has the same slope as an isoprofit line,
A) there may be more than one optimum
solution.
B) the problem involves redundancy.
C) an error has been made in the problem
formulation.
D) a condition of infeasibility exists.
E) None of the above
37) The simultaneous equation method is
A) an alternative to the corner point
method.
B) useful only in minimization methods.
C) an algebraic means for solving the
intersection of two or more constraint equations.
D) useful only when more than two product
variables exist in a product mix problem.
E) None of the above
38) 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
39) Consider the following linear
programming problem:
.jpg”>
The feasible corner points are (48,84),
(0,120), (0,0), (90,0). What is the maximum possible value for the objective
function?
A) 1032
B) 1200
C) 360
D) 1600
E) None of the above
40) Consider the following linear
programming problem:
.jpg”>
Which of the following points (X,Y) is not
a feasible corner point?
A) (0,60)
B) (105,0)
C) (120,0)
D) (100,10)
E) None of the above
41) Consider the following linear
programming problem:
.jpg”>
Which of the following points (X,Y) is not
feasible?
A) (50,40)
B) (20,50)
C) (60,30)
D) (90,10)
E) None of the above
42) Two models of a product Regular (X)
and Deluxe (Y) are produced by a company. A linear programming model is used
to determine the production schedule. The formulation is as follows:
.jpg”>
The optimal solution is X = 100, Y = 0.
How many units of the regular model would
be produced based on this solution?
A) 0
B) 100
C) 50
D) 120
E) None of the above
43) Two models of a product Regular (X)
and Deluxe (Y) are produced by a company. A linear programming model is used
to determine the production schedule. The formulation is as follows:
.jpg”>
The optimal solution is X = 100, Y = 0.
Which of these constraints is redundant?
A) the first constraint
B) the second constraint
C) the third constraint
D) All of the above
E) None of the above
44) Consider the following linear
programming problem:
.jpg”>
What is the optimum solution to this
problem (X,Y)?
A) (0,0)
B) (50,0)
C) (0,100)
D) (400,0)
E) None of the above
45) 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
46) 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
Answer:
A
Diff: 3
Topic: GRAPHICAL SOLUTION TO AN LP PROBLEM
AACSB: Analytic
Skills47) Which of the following is not
acceptable as a constraint in a linear programming problem (maximization)?
.jpg”>
A) Constraint 1
B) Constraint 2
C) Constraint 3
D) Constraint 4
E) None of the above
48) If one changes the contribution rates
in the objective function of an LP,
A) the feasible region will change.
B) the slope of the isoprofit or isocost
line will change.
C) the optimal solution to the LP is sure
to no longer be optimal.
D) All of the above
E) None of the above
49) Sensitivity analysis may also be
called
A) postoptimality analysis.
B) parametric programming.
C) optimality analysis.
D) All of the above
E) None of the above
50) Sensitivity analyses are used to
examine the effects of changes in
A) contribution rates for each variable.
B) technological coefficients.
C) available resources.
D) All of the above
E) None of the above31) Which of the following is not a
part of every linear programming problem formulation?A) an objective functionB) a set of constraintsC) non-negativity constraintsD) a redundant constraintE) maximization or minimization of a
linear function32) When appropriate, the optimal solution
to a maximization linear programming problem can be found by graphing the
feasible region andA) finding the profit at every corner
point of the feasible region to see which one gives the highest value.B) moving the isoprofit lines towards the
origin in a parallel fashion until the last point in the feasible region is
encountered.C) locating the point that is highest on
the graph.D) None of the aboveE) All of the above33) The mathematical theory behind linear
programming states that an optimal solution to any problem will lie at a(n)
________ of the feasible region.A) interior point or centerB) maximum point or minimum pointC) corner point or extreme pointD) interior point or extreme pointE) None of the above34) Which of the following is not a
property of linear programs?A) one objective functionB) at least two separate feasible regionsC) alternative courses of actionD) one or more constraintsE) objective function and constraints are
linear35) The corner point solution methodA) will always provide one, and only one,
optimum.B) will yield different results from the
isoprofit line solution method.C) requires that the profit from all
corners of the feasible region be compared.D) requires that all corners created by
all constraints be compared.E) will not provide a solution at an
intersection or corner where a non-negativity constraint is involved.36) When a constraint line bounding a
feasible region has the same slope as an isoprofit line,A) there may be more than one optimum
solution.B) the problem involves redundancy.C) an error has been made in the problem
formulation.D) a condition of infeasibility exists.E) None of the above37) The simultaneous equation method isA) an alternative to the corner point
method.B) useful only in minimization methods.C) an algebraic means for solving the
intersection of two or more constraint equations.D) useful only when more than two product
variables exist in a product mix problem.E) None of the above38) 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 above39) Consider the following linear
programming problem:.jpg”>The feasible corner points are (48,84),
(0,120), (0,0), (90,0). What is the maximum possible value for the objective
function?A) 1032B) 1200C) 360D) 1600E) None of the above40) Consider the following linear
programming problem:.jpg”>Which of the following points (X,Y) is not
a feasible corner point?A) (0,60)B) (105,0)C) (120,0)D) (100,10)E) None of the above41) Consider the following linear
programming problem:.jpg”>Which of the following points (X,Y) is not
feasible?A) (50,40)B) (20,50)C) (60,30)D) (90,10)E) None of the above42) Two models of a product Regular (X)
and Deluxe (Y) are produced by a company. A linear programming model is used
to determine the production schedule. The formulation is as follows:.jpg”>The optimal solution is X = 100, Y = 0.How many units of the regular model would
be produced based on this solution?A) 0B) 100C) 50D) 120E) None of the above43) Two models of a product Regular (X)
and Deluxe (Y) are produced by a company. A linear programming model is used
to determine the production schedule. The formulation is as follows:.jpg”>The optimal solution is X = 100, Y = 0.Which of these constraints is redundant?A) the first constraintB) the second constraintC) the third constraintD) All of the aboveE) None of the above44) Consider the following linear
programming problem:.jpg”>What is the optimum solution to this
problem (X,Y)?A) (0,0)B) (50,0)C) (0,100)D) (400,0)E) None of the above45) 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 above46) 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 aboveAnswer:
ADiff: 3Topic: GRAPHICAL SOLUTION TO AN LP PROBLEMAACSB: Analytic
Skills47) Which of the following is not
acceptable as a constraint in a linear programming problem (maximization)?.jpg”>A) Constraint 1B) Constraint 2C) Constraint 3D) Constraint 4E) None of the above48) If one changes the contribution rates
in the objective function of an LP,A) the feasible region will change.B) the slope of the isoprofit or isocost
line will change.C) the optimal solution to the LP is sure
to no longer be optimal.D) All of the aboveE) None of the above49) Sensitivity analysis may also be
calledA) postoptimality analysis.B) parametric programming.C) optimality analysis.D) All of the aboveE) None of the above50) Sensitivity analyses are used to
examine the effects of changes inA) contribution rates for each variable.B) technological coefficients.C) available resources.D) All of the aboveE) None of the above
