The term boundary case is frequently used in
software engineering to refer to the behavior of a system when one of its inputs is at or just beyond its maximum or minimum limits. It is frequently used when discussing
software testing.For example, if an input field is meant to accept only integer values 0 - 100, entering the values -1, 0, 100, and 101 would represent the boundary cases.It is commonly thought that three cases should be used when boundary testing (one on the boundary, and one on either side to it). However, the case on the valid side of the boundary is redundant, and so
equivalence partitioning recommends skipping it.
See more at Wikipedia.org...
A boundary case occurs when a parameter iterates to the "boundary" of the permissible "parameter space" (see
Structural Equation Modeling ). For example, a variance can only take on values from 0 to infinity. If, during iteration, the program attempts to move an estimate of a variance below zero, the program will constrain it to be on the boundary value of 0.
For some problems (for example a
Heywood Case in factor analysis), it may be possible to reduce the
discrepancy function by estimating a variance to be a negative number. In that case, the program does "the best it can" within the permissible parameter space, but does not actually obtain the "global minimum" of the discrepancy function.