THEORETICAL QUESTIONS
- When is a linear programming problem said to have multiple solutions under Simplex Method?
- When is a linear programming problem said to have an unbounded solution under Simplex Method?
- When is a linear programming problem said to be infeasible under Simplex Method?
- When is degeneracy in a linear programming problem said to occur under Simplex Method?
- Define the following terms:
- Slack variables
- Key column
- Replacement ratio
- Key row
- Key element or Pivot element
- Surplus variables
- Artificial variables
- Dual problem
- Shadow price or Imputed price
- Which column in marked as 'Key Column' in case of
- A maximization problem
- A minimization problem
- Which row is marked as 'Key Row' in case of
- A maximization problem
- A minimization ...
Get Quantitative Techniques: Theory and Problems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.