1. What does it mean if a variable remains non-basic in the optimal solution of an LP problem?
A) Its optimal value is zero, and it does not contribute to the objective function at the optimum.
B) Its optimal value is positive.
C) It must be included in the optimal solution.
D) It indicates an infeasible problem.
2. The Simplex Method guarantees finding an optimal solution if one exists, provided that:
A) The problem is well-defined and does not exhibit cycling.
B) The number of iterations is finite.
C) All variables are integers.
D) The feasible region is unbounded.
3. What is the interpretation of a negative shadow price for a constraint in a maximization problem?
A) Increasing the RHS of that constraint would decrease the optimal objective value.
B) Increasing the RHS of that constraint would increase the optimal objective value.
C) The constraint is non-binding.
D) The variable associated with the constraint is non-basic.
4. Sensitivity analysis helps in understanding how changes in LP model parameters affect:
A) The optimal solution and the optimal objective value.
B) The number of decision variables.
C) The type of constraints.
D) The graphical representation of the problem.
5. If the optimal solution to the primal problem is unique, what can be said about the optimal solution to the dual problem?
A) The optimal solution to the dual problem is also unique.
B) The dual problem has multiple optimal solutions.
C) The dual problem is infeasible.
D) The dual problem is unbounded.
6. Which of the following describes the 'primal-dual relationship' in Linear Programming?
A) For every LP problem (primal), there exists a corresponding dual problem, and their optimal solutions are related.
B) The primal and dual problems are identical.
C) The primal problem is always a minimization problem, and the dual is a maximization problem.
D) The solution of the primal problem provides the constraints for the dual problem.
7. The 'Basis' in the Simplex Method refers to:
A) The set of basic variables in a particular iteration.
B) The objective function coefficients.
C) The constraints of the problem.
D) The optimal solution.
8. What is the condition for multiple optimal solutions in a Linear Programming problem solved by the Simplex Method?
A) A non-basic variable has a zero coefficient in the objective function row of the optimal tableau.
B) All basic variables are zero.
C) The objective function value is zero.
D) The feasible region is empty.
9. The graphical method for solving LP problems is only practical for problems with:
A) At most two decision variables.
B) At least three decision variables.
C) No constraints.
D) Only equality constraints.
10. If Phase I of the Two-Phase Method results in an objective value greater than zero, it implies:
A) The original LP problem has no feasible solution.
B) The original LP problem has an optimal solution.
C) The original LP problem is unbounded.
D) Further iterations are needed in Phase I.
11. In Phase I of the Two-Phase Method, the objective is to:
A) Minimize the sum of artificial variables.
B) Maximize the sum of artificial variables.
C) Find the optimal solution to the original problem.
D) Introduce slack variables.
12. The 'Two-Phase Method' is an alternative to the Big M method for handling:
A) Artificial variables.
B) Non-linear constraints.
C) Integer programming.
D) Unbounded solutions.
13. Which of the following is NOT an assumption of Linear Programming?
A) Non-negativity of variables.
B) Linearity of the objective function and constraints.
C) Integer values for all variables.
D) Divisibility of variables.
14. The 'reduced cost' of a non-basic variable in the optimal Simplex Tableau represents:
A) The amount by which the objective function would decrease (for maximization) if that variable were increased by one unit.
B) The amount by which the objective function would increase (for maximization) if that variable were increased by one unit.
C) The current value of the non-basic variable.
D) The number of iterations needed to make it basic.
15. Bland's rule is a technique used to prevent:
A) Cycling in the Simplex Method.
B) Infeasibility.
C) Unboundedness.
D) Degeneracy.
16. Cycling in the Simplex Method occurs when:
A) The algorithm returns to a previous basic feasible solution, preventing convergence.
B) The objective function value decreases indefinitely.
C) All constraints are violated.
D) The tableau becomes too large.
17. What does degeneracy in the Simplex Method refer to?
A) A basic variable having a value of zero in a basic feasible solution.
B) An unbounded solution.
C) An infeasible solution.
D) The objective function having multiple optimal solutions.
18. If a problem involves minimizing a function, it can be converted to a maximization problem by:
A) Multiplying the objective function by -1.
B) Multiplying all constraints by -1.
C) Swapping the inequality signs of the constraints.
D) Adding a large constant to the objective function.
19. What is the purpose of the 'replacement ratio' in the Simplex Method?
A) To determine which current basic variable will leave the basis.
B) To select the entering variable.
C) To calculate the value of the objective function.
D) To check for optimality.
20. Consider an LP problem: Maximize Z = 3x1 + 2x2, subject to x1 + x2 ≤ 4, 2x1 + x2 ≤ 6, x1, x2 ≥ 0. If we add slack variables s1 and s2, the constraints become x1 + x2 + s1 = 4 and 2x1 + x2 + s2 = 6. What is the initial basic feasible solution?
A) x1=0, x2=0, s1=4, s2=6, Z=0
B) x1=4, x2=0, s1=0, s2=-2, Z=12
C) x1=0, x2=4, s1=0, s2=2, Z=8
D) x1=3, x2=1, s1=0, s2=0, Z=11
21. If the primal problem is infeasible, what can be said about the dual problem?
A) The dual problem is either unbounded or infeasible.
B) The dual problem is always unbounded.
C) The dual problem always has an optimal solution.
D) The dual problem is always feasible but not necessarily optimal.
22. What is the fundamental difference between the Simplex Method and the graphical method for solving LP problems?
A) The Simplex Method can handle problems with many variables and constraints, while the graphical method is limited to two variables.
B) The graphical method is iterative, while the Simplex Method is not.
C) The Simplex Method always finds an integer solution, while the graphical method does not.
D) The graphical method uses a tableau, while the Simplex Method does not.
23. The 'range of feasibility' for a shadow price refers to:
A) The range of changes in the RHS of a constraint for which the current basis remains optimal.
B) The range of values the objective function can take.
C) The range of values for the decision variables.
D) The number of iterations allowed.
24. In a minimization problem using the Simplex Method, when is the optimal solution reached?
A) When all coefficients in the objective function row (Cj - Zj row) are non-positive (≤ 0).
B) When all coefficients are non-negative.
C) When the objective function value is maximized.
D) When the number of iterations equals the number of variables.
25. Which of the following scenarios would require the use of artificial variables?
A) Constraints of the type '≥' or '=' when the origin is not a feasible starting point.
B) Constraints of the type '≤' where the origin is feasible.
C) Problems with only non-negativity constraints.
D) Problems where the objective is to minimize.
26. The Simplex Method terminates when:
A) An optimal solution is found, or it's determined that the problem is infeasible or unbounded.
B) The number of iterations exceeds 100.
C) All variables become non-basic.
D) The objective function value becomes zero.
27. If a non-basic variable has a negative coefficient in the objective function row (Cj - Zj) of the optimal Simplex Tableau for a maximization problem, what does this imply?
A) The current solution is not optimal, and introducing this variable would improve the objective function.
B) The current solution is optimal.
C) The problem is infeasible.
D) The problem is unbounded.
28. What does a 'shadow price' (or dual value) represent in Linear Programming?
A) The change in the optimal objective function value per unit increase in the RHS of a constraint, within the range of feasibility.
B) The cost of introducing a new variable.
C) The minimum value of the objective function.
D) The number of iterations required to reach optimality.
29. In the context of sensitivity analysis for an LP problem solved by the Simplex Method, what does changing the right-hand side (RHS) of a constraint affect?
A) The optimal value of the objective function and the values of the basic variables.
B) The coefficients of the objective function.
C) The number of decision variables.
D) The feasibility of the solution.
30. According to the Duality Theorem, if the primal problem has an optimal solution, then:
A) The dual problem also has an optimal solution, and their optimal objective values are equal.
B) The dual problem has no optimal solution.
C) The dual problem has an unbounded solution.
D) The dual problem's objective value is the negative of the primal's.
31. What is the 'dual problem' in Linear Programming?
A) A related LP problem derived from the primal problem, with constraints and objective function swapped.
B) A simplified version of the original LP problem.
C) The graphical representation of the primal problem.
D) The problem solved after the primal is proven unbounded.
32. The Dual Simplex Method is particularly useful when:
A) The initial basic solution is feasible but not optimal, and we need to maintain feasibility.
B) The initial basic solution is optimal but not feasible.
C) The problem involves only maximization.
D) The problem has no feasible solution.
33. Which of the following is a fundamental assumption of Linear Programming?
A) Divisibility of variables, certainty, and proportionality.
B) Non-linearity of the objective function.
C) Integer values for all decision variables.
D) Stochastic nature of constraints.
34. What is the 'Big M' method used for in Linear Programming?
A) To handle problems with artificial variables in both maximization and minimization problems.
B) To simplify the graphical solution method.
C) To solve problems with only equality constraints.
D) To find the initial basic feasible solution without artificial variables.
35. If a maximization problem has an unbounded solution, what would be observed in the Simplex Tableau?
A) A pivot column can be selected, but all elements in that column are non-positive (≤ 0).
B) All coefficients in the objective function row are positive.
C) The feasible region is empty.
D) The optimal solution is found immediately.
36. What happens to the 'basic variable' corresponding to the pivot row when a pivot operation is performed in the Simplex Method?
A) It becomes a non-basic variable.
B) It remains a basic variable.
C) It is removed from the tableau.
D) It becomes equal to the pivot element.
37. The 'pivot row' in the Simplex Method is determined by:
A) The minimum ratio test (positive ratios of the right-hand side to the corresponding pivot column element).
B) The maximum ratio test.
C) The row with the largest sum.
D) The row corresponding to the artificial variable.
38. In the Simplex Method, the 'pivot column' is typically chosen based on:
A) The most negative coefficient in the objective function row (for maximization).
B) The largest positive coefficient in the objective function row.
C) The smallest slack variable.
D) The constraint with the most variables.
39. The 'Simplex Tableau' is a tabular representation used in the Simplex Method to:
A) Organize the coefficients of the objective function and constraints for iterative calculations.
B) Visualize the feasible region graphically.
C) Calculate statistical measures of a dataset.
D) Perform sensitivity analysis on the optimal solution.
40. What is an 'artificial variable' introduced in the Simplex Method?
A) To help find an initial basic feasible solution when the origin is not feasible.
B) To represent the objective function.
C) To convert '≤' constraints to equalities.
D) To ensure the solution is always positive.
41. When solving an LP problem using the Simplex Method, what indicates that the current basic feasible solution is optimal?
A) All coefficients in the objective function row (Cj - Zj row) are non-negative (for maximization).
B) The sum of all decision variables is zero.
C) The objective function value is negative.
D) All constraints are satisfied with equality.
42. What are 'surplus variables' used for in the Simplex Method?
A) To convert inequality constraints of the type '≥' into equalities.
B) To represent the objective function coefficients.
C) To add artificial constraints.
D) To minimize the objective function.
43. In the context of the Simplex Method, what are 'slack variables' used for?
A) To convert inequality constraints of the type '≤' into equalities.
B) To represent the decision variables.
C) To indicate the objective function.
D) To penalize infeasible solutions.
44. What is the Simplex Method primarily designed for?
A) Solving Linear Programming problems systematically.
B) Finding approximate solutions to complex equations.
C) Performing statistical hypothesis testing.
D) Optimizing non-linear functions.
45. Which method is commonly used to solve Linear Programming problems graphically?
A) Plotting the constraints and identifying the corner points of the feasible region.
B) Using calculus to find derivatives of the objective function.
C) Applying matrix algebra to solve systems of equations.
D) Iteratively adjusting variables until optimality is reached.
46. What does the 'feasible region' represent in a Linear Programming problem?
A) The set of all possible solutions that satisfy all the constraints.
B) The optimal solution to the problem.
C) The objective function's value at a specific point.
D) The variables used in the problem.
47. In Linear Programming, what are the constraints typically expressed as?
A) Linear equalities or inequalities.
B) Non-linear equations.
C) Quadratic inequalities.
D) Differential equations.
48. What is the primary objective of Linear Programming (LP)?
A) To maximize or minimize a linear objective function subject to linear constraints.
B) To find integer solutions to a system of linear equations.
C) To perform statistical analysis on a dataset.
D) To optimize non-linear functions with inequality constraints.