Searched refs:SOLVELP_UNBOUNDED (Results 1 – 2 of 2) sorted by relevance
124 if((res=inner_simplex(c,b,v,N,B,indexToRow))==SOLVELP_UNBOUNDED){ in solveLP()125 return SOLVELP_UNBOUNDED; in solveLP()298 return SOLVELP_UNBOUNDED; in inner_simplex()
259 …SOLVELP_UNBOUNDED = -2, //!< problem is unbounded (target function can achieve arbitrary high v… enumerator