Originally posted by: T_O
If you understand the difference between basic and nonbasic variables, it is trivial:
In simplex algorithms where variables can have upper and lower bounds, a nonbasic variable can either be free (no bounds existing) [3] or attain one of its bounds (lower [0], upper [2]) (if there is only one bound, it can of course only attain this one). The same is true for the slack variables, so also constraints have a basis status. Be careful: If a slack variable is at its upper bound, then the corresponding constraint is at its lower bound, and vice versa.
Concerning superbasic variables: I think these are variables that CPLEX fixes during some iterations to some value. I do not know the details and I don't know whether this will happen in pure LPs.
Best regards,
Thomas
#CPLEXOptimizers#DecisionOptimization