Master Simplex Method Nuances: Ace Your
Operations Research Quiz 5
Confidently tackle the intricacies of the Simplex Method with this focused set
of True/False questions! Designed to test your deep understanding of key
conditions, implications, and potential pitfalls within the Simplex algorithm,
this material will sharpen your analytical skills and prepare you to excel in
your Operations Research assessments.
Why This Quiz is Your Key to Simplex Mastery:
Targeted Focus: Specifically examines critical aspects of the Simplex
Method, including ties, unbounded solutions, multiple optima, artificial
variables, and the Big M vs. Two-Phase methods.
Deep Conceptual Understanding: Forces you to go beyond rote
memorization and apply your knowledge to nuanced scenarios.
Identify Common Misconceptions: Clarifies potential areas of confusion
and reinforces accurate understanding of the algorithm's behavior.
Exam-Ready Format: Familiarizes you with the type of conceptual
questions often encountered in Operations Research quizzes and exams.
Concise and Effective: Delivers focused practice without unnecessary fluff,
maximizing your study efficiency.
Operations Research Quiz 5: Simplex Method - True or False?
Instructions: Determine whether each of the following statements is True or
False.
1. In a particular iteration of the simplex method, if there is a tie for which
variable should be the leaving basic variable, then the next BF solution must
have at least one basic variable equal to zero. * Answer: True - All tied leaving
basic variables reach zero at the same time as the entering basic variable is
increased, so the tied leaving basic variables that were not chosen would be basic
variables equal to zero in the next BF solution.
2. If there is no leaving basic variable at some iteration, then the problem has
no feasible solutions. * Answer: False - If there is no leaving basic variable at
some iteration, then the problem has feasible solutions but no optimal solution
because the entering basic variable could be increased indefinitely, which would
also increase Z indefinitely.
, 3. If at least one of the basic variables has a coefficient of zero in row 0 of the
final tableau, then the problem has multiple optimal solutions. * Answer:
False - If at least one of the non-basic variables has a coefficient of zero in row 0
of the final tableau, then the problem has multiple solutions because increasing the
non-basic variables with a coefficient of zero in row 0 will not change the value of
Z.
4. If the problem has multiple optimal solutions, then the problem must have a
bounded feasible region. * Answer: True - If the problem has multiple optimal
solutions, then the objective function must be parallel to one of the constraints. For
this parallelism to result in multiple optimal corner-point solutions (and thus
multiple optimal solutions along the edge connecting them), the feasible region
must be bounded in that direction.
5. When a linear programming model has an equality constraint, an artificial
variable is introduced into this constraint in order to start the simplex method
with an obvious initial basic solution that is feasible for the original model. *
Answer: False - When a linear programming model has an equality constraint, an
artificial variable is introduced to have an initial basic variable for that equation.
The initial solution found with the artificial variable is not necessarily feasible for
the original model because the artificial variable might be non-zero. The goal is to
drive the artificial variables to zero to obtain a feasible solution for the original
problem.
6. When an artificial problem is created by introducing artificial variables, if
all artificial variables in an optimal solution for the artificial problem are
equal to zero, then the real problem has no feasible solutions. * Answer: False
- When an artificial problem is created by introducing artificial variables and using
the Big M method (or Phase I of the Two-Phase method), if all artificial variables
in an optimal solution for the artificial problem are equal to zero, then a basic
feasible solution for the real problem has been found. If any artificial variable is
not equal to zero at optimality, then the real problem has no feasible solutions.
7. The two-phase method is commonly used in practice because it usually
requires fewer iterations to reach an optimal solution than the Big M method
does. * Answer: False - The two-phase and Big M methods usually require a
similar number of iterations to reach an optimal solution. The primary advantage of
the two-phase method is that it avoids dealing with the potentially problematic "M"
value, which can lead to computational inaccuracies if not chosen carefully.
Operations Research Quiz 5
Confidently tackle the intricacies of the Simplex Method with this focused set
of True/False questions! Designed to test your deep understanding of key
conditions, implications, and potential pitfalls within the Simplex algorithm,
this material will sharpen your analytical skills and prepare you to excel in
your Operations Research assessments.
Why This Quiz is Your Key to Simplex Mastery:
Targeted Focus: Specifically examines critical aspects of the Simplex
Method, including ties, unbounded solutions, multiple optima, artificial
variables, and the Big M vs. Two-Phase methods.
Deep Conceptual Understanding: Forces you to go beyond rote
memorization and apply your knowledge to nuanced scenarios.
Identify Common Misconceptions: Clarifies potential areas of confusion
and reinforces accurate understanding of the algorithm's behavior.
Exam-Ready Format: Familiarizes you with the type of conceptual
questions often encountered in Operations Research quizzes and exams.
Concise and Effective: Delivers focused practice without unnecessary fluff,
maximizing your study efficiency.
Operations Research Quiz 5: Simplex Method - True or False?
Instructions: Determine whether each of the following statements is True or
False.
1. In a particular iteration of the simplex method, if there is a tie for which
variable should be the leaving basic variable, then the next BF solution must
have at least one basic variable equal to zero. * Answer: True - All tied leaving
basic variables reach zero at the same time as the entering basic variable is
increased, so the tied leaving basic variables that were not chosen would be basic
variables equal to zero in the next BF solution.
2. If there is no leaving basic variable at some iteration, then the problem has
no feasible solutions. * Answer: False - If there is no leaving basic variable at
some iteration, then the problem has feasible solutions but no optimal solution
because the entering basic variable could be increased indefinitely, which would
also increase Z indefinitely.
, 3. If at least one of the basic variables has a coefficient of zero in row 0 of the
final tableau, then the problem has multiple optimal solutions. * Answer:
False - If at least one of the non-basic variables has a coefficient of zero in row 0
of the final tableau, then the problem has multiple solutions because increasing the
non-basic variables with a coefficient of zero in row 0 will not change the value of
Z.
4. If the problem has multiple optimal solutions, then the problem must have a
bounded feasible region. * Answer: True - If the problem has multiple optimal
solutions, then the objective function must be parallel to one of the constraints. For
this parallelism to result in multiple optimal corner-point solutions (and thus
multiple optimal solutions along the edge connecting them), the feasible region
must be bounded in that direction.
5. When a linear programming model has an equality constraint, an artificial
variable is introduced into this constraint in order to start the simplex method
with an obvious initial basic solution that is feasible for the original model. *
Answer: False - When a linear programming model has an equality constraint, an
artificial variable is introduced to have an initial basic variable for that equation.
The initial solution found with the artificial variable is not necessarily feasible for
the original model because the artificial variable might be non-zero. The goal is to
drive the artificial variables to zero to obtain a feasible solution for the original
problem.
6. When an artificial problem is created by introducing artificial variables, if
all artificial variables in an optimal solution for the artificial problem are
equal to zero, then the real problem has no feasible solutions. * Answer: False
- When an artificial problem is created by introducing artificial variables and using
the Big M method (or Phase I of the Two-Phase method), if all artificial variables
in an optimal solution for the artificial problem are equal to zero, then a basic
feasible solution for the real problem has been found. If any artificial variable is
not equal to zero at optimality, then the real problem has no feasible solutions.
7. The two-phase method is commonly used in practice because it usually
requires fewer iterations to reach an optimal solution than the Big M method
does. * Answer: False - The two-phase and Big M methods usually require a
similar number of iterations to reach an optimal solution. The primary advantage of
the two-phase method is that it avoids dealing with the potentially problematic "M"
value, which can lead to computational inaccuracies if not chosen carefully.
