
<UL>
<LI>    0  - no solution within constraints
<LI>    1  - ok, solutions returned
<LI>   -1  - too many (> MAX_BASIS) base solutions exist
</UL>
<A NAME="next_combo_a"></A><HR><PRE><B>int next_combo_a(int length, int basis[MAX_BASIS][MAX_COEF],
		 int num_basis, int constraints[MAX_COEF],
		 int combo[MAX_BASIS], int sum[MAX_COEF],
		 int start_flag);
</B></PRE>This routine gets the first or next appropriate subset of the
basis of solutions.  "Appropriate" means that each variable gets
instantiated to s