Return code

Next: Debugging Up: Implementation Previous: Distinct solutions

The procedure will return an integer

$k\ge 0$ : number of solutions
: the size of the storage is too low ( possible solutions: increase M, or use the 3B method, or use the reverse storage mode or the single bisection mode)
: m or n is not strictly positive
: Order is not 0 or 1
: one of the function in the system has not a type 0, -1 or 1 (i.e. it's not an equation, neither inequality $F \le 0$ or an inequality $F \ge 0$ )
: we are in the optimization mode and more than one functions are expressions to be optimized (see the Optimization chapter)
: in the mixed bisection mode the number of variables that will be bisected is larger than the number of unknowns
: one of the value of ALIAS_Delta3B or ALIAS_Max3B is negative or 0
: one of the value of ALIAS_SubEq3B is not 0 or 1
: although ALIAS_SubEq3B has as size the number of equations none of its components is 1
: ALIAS_ND is different from 0 (i.e. we are dealing with a non-0 dimensional problem, see the corresponding chapter) and the name of the result file has not been specified
: the value of the flag Single_Bisection is not correct
: we use the full bisection mode and the problem has more than 10 unknowns