For the simplex method, we need to add slack variables. My question is how to determine how many slack variables should be considered in the LP problem? I don't quite get why in the cases to find out the minimum objective function with the lower bounded constraint, the number of slack variable is $2n$ where $n$ is the number of constraints. while in the max objective function with upper bounded constraint, the number of slack variable is $n$. Did I miss something about the simplex method?
A question about the operation research and simplex method
2
$\begingroup$
optimization
linear-programming
operations-research