tions. This is determined by looking for components that
have * in their range, and have constraint factors associated with them. If such a component exists, we need both
lower and upper bounds. Otherwise, just one of the bounds suffices because they are equivalent; it defaults to
lower in this case.</p></div><dl class="paramcmts block"><dt>returns</dt><dd class="cmt"><p>All bounds for which this algorithm should compute solutions.</p></dd></dl><dl class="attributes block"> <dt>Definition Classes</dt><dd><a