In the simplex method, all slack, surplus, and artificial variables must be non-negative to maintain a feasible solution. This ensures that the constraints of the linear programming problem are properly satisfied.
In the simplex method, the slack, surplus and artificial variables are restricted to be?
Review the verified answer and explanation for this SPSC – Sindh Public Service Commission past-paper question on CampusFin.
Question context
This question is part of 📏 Arithmetic Aptitude within the broader 🧠 Aptitude Mastery subject and appears in the SPSC – Sindh Public Service Commission preparation collection. Reviewing the answer together with nearby questions helps reinforce the underlying concept and identify how it may appear in competitive exams.