63 for( j = 0; j < idx.
size(); ++j)
81 else if (x < -epsilon)
103 if ( ( x > epsilon && vec[leave] >= ub[leave] ) ||
104 ( x < -epsilon && vec[leave] <= lb[leave] ) )
110 val = (x > epsilon) ? ub[leave] : lb[leave];
111 val = (val - vec[leave]) / x;
119 for( j = 0; j < idx.
size(); ++j)
137 else if (x > epsilon)
156 if ( ( x < -epsilon && vec[leave] >= ub[leave] ) ||
157 ( x > epsilon && vec[leave] <= lb[leave] ) )
163 val = (x < epsilon) ? ub[leave] : lb[leave];
164 val = (val - vec[leave]) / x;
207 for( j = 0; j < pidx.
size(); ++j )
226 else if (x < -epsilon)
241 for( j = 0; j < cidx.
size(); ++j )
260 else if (x < -epsilon)
277 i = cidx.
index(cnum);
279 val = (x > epsilon) ? ucb[i] : lcb[i];
280 val = (val - cvec[i]) / x;
284 i = pidx.
index(pnum);
286 val = (x > epsilon) ? upb[i] : lpb[i];
287 val = (val - pvec[i]) / x;
292 for( j = 0; j < pidx.
size(); ++j )
311 else if (x < -epsilon)
326 for( j = 0; j < cidx.
size(); ++j )
345 else if (x < -epsilon)
362 i = cidx.
index(cnum);
364 val = (x < epsilon) ? ucb[i] : lcb[i];
365 val = (val - cvec[i]) / x;
369 i = pidx.
index(pnum);
371 val = (x < epsilon) ? upb[i] : lpb[i];
372 val = (val - pvec[i]) / x;
389 spxout <<
"DDEFRT02 !isValid(): max=" << max <<
", x=" << x << std::endl;