61 for( j = 0; j < idx.
size(); ++j)
79 else if (x < -epsilon)
101 if ( ( x > epsilon && vec[leave] >= ub[leave] ) ||
102 ( x < -epsilon && vec[leave] <= lb[leave] ) )
108 val = (x > epsilon) ? ub[leave] : lb[leave];
109 val = (val - vec[leave]) / x;
117 for( j = 0; j < idx.
size(); ++j)
135 else if (x > epsilon)
154 if ( ( x < -epsilon && vec[leave] >= ub[leave] ) ||
155 ( x > epsilon && vec[leave] <= lb[leave] ) )
161 val = (x < epsilon) ? ub[leave] : lb[leave];
162 val = (val - vec[leave]) / x;
205 for( j = 0; j < pidx.
size(); ++j )
224 else if (x < -epsilon)
239 for( j = 0; j < cidx.
size(); ++j )
258 else if (x < -epsilon)
275 i = cidx.
index(cnum);
277 val = (x > epsilon) ? ucb[i] : lcb[i];
278 val = (val - cvec[i]) / x;
282 i = pidx.
index(pnum);
284 val = (x > epsilon) ? upb[i] : lpb[i];
285 val = (val - pvec[i]) / x;
290 for( j = 0; j < pidx.
size(); ++j )
309 else if (x < -epsilon)
324 for( j = 0; j < cidx.
size(); ++j )
343 else if (x < -epsilon)
360 i = cidx.
index(cnum);
362 val = (x < epsilon) ? ucb[i] : lcb[i];
363 val = (val - cvec[i]) / x;
367 i = pidx.
index(pnum);
369 val = (x < epsilon) ? upb[i] : lpb[i];
370 val = (val - pvec[i]) / x;
376 MSG_DEBUG( std::cout <<
"DDEFRT01 isValid() && isBasic(): max=" << max
387 std::cout <<
"DDEFRT02 !isValid(): max=" << max <<
", x=" << x << std::endl;