Quantitative Techniques: Theory and Problems

THEORETICAL QUESTIONS

1. When is a linear programming problem said to have multiple solutions under Simplex Method?
2. When is a linear programming problem said to have an unbounded solution under Simplex Method?
3. When is a linear programming problem said to be infeasible under Simplex Method?
4. When is degeneracy in a linear programming problem said to occur under Simplex Method?
5. Define the following terms:
   1. Slack variables
   2. Key column
   3. Replacement ratio
   4. Key row
   5. Key element or Pivot element
   6. Surplus variables
   7. Artificial variables
   8. Dual problem
   9. Shadow price or Imputed price
6. Which column in marked as 'Key Column' in case of
   1. A maximization problem
   2. A minimization problem
7. Which row is marked as 'Key Row' in case of
   1. A maximization problem
   2. A minimization ...