1. If in a two-dimensional problem (the objective function depends on two variables) we have three zero basic variables at a simplex iteration, how many redundant constraints exist at this corner point?
2. In an n-dimensional problem, how many constraints must pass through a corner point to produce a degenerate situation?
3. Is the number of basic solutions larger than the number of corner points under degenerate conditions?
4. Assuming that cycling will not occur, what is the ultimate effect of degeneracy on computations as compared to the case where redundant constraints are removed (that is, degeneracy is removed)?
5. Explain why negative or zero constraints coefficients in the column of a nonbasic variable indicate that the variable can be increased indefinitely without violating feasibility.
6. Can the condition of unboundedness always be detected from the starting simplex iteration?