/// This also updates next bound
inline double changeInCost(int iRow, double alpha, double &rhs) {
int sequence=model_->pivotVariable()[iRow];
double returnValue = 0.0;
unsigned char iStatus = status_[sequence];
int iWhere = currentStatus(iStatus);
if (iWhere == CLP_SAME)
iWhere = originalStatus(iStatus);
// rhs always increases
if (iWhere == CLP_FEASIBLE) {
if (alpha > 0.0) {
// going below
iWhere = CLP_BELOW_LOWER;
rhs = COIN_DBL_MAX;
} else {
// going above
iWhere = CLP_ABOVE_UPPER;
rhs = COIN_DBL_MAX;
}
} else if (iWhere == CLP_BELOW_LOWER) {
assert (alpha < 0);
// going feasible
iWhere = CLP_FEASIBLE;
rhs += bound_[sequence] - model_->upperRegion()[sequence];
} else {
assert (iWhere == CLP_ABOVE_UPPER);
// going feasible
iWhere = CLP_FEASIBLE;
rhs += model_->lowerRegion()[sequence] - bound_[sequence];
}
setCurrentStatus(status_[sequence], iWhere);
returnValue = fabs(alpha) * infeasibilityWeight_;
return returnValue;
}
/// This also updates next bound
inline double changeInCost(int sequence, double alpha, double &rhs) {
double returnValue = 0.0;
#ifdef NONLIN_DEBUG
double saveRhs = rhs;
#endif
if (CLP_METHOD1) {
int iRange = whichRange_[sequence] + offset_[sequence];
if (alpha > 0.0) {
assert(iRange - 1 >= start_[sequence]);
offset_[sequence]--;
rhs += lower_[iRange] - lower_[iRange-1];
returnValue = alpha * (cost_[iRange] - cost_[iRange-1]);
} else {
assert(iRange + 1 < start_[sequence+1] - 1);
offset_[sequence]++;
rhs += lower_[iRange+2] - lower_[iRange+1];
returnValue = alpha * (cost_[iRange] - cost_[iRange+1]);
}
}
if (CLP_METHOD2) {
#ifdef NONLIN_DEBUG
double saveRhs1 = rhs;
rhs = saveRhs;
#endif
unsigned char iStatus = status_[sequence];
int iWhere = currentStatus(iStatus);
if (iWhere == CLP_SAME)
iWhere = originalStatus(iStatus);
// rhs always increases
if (iWhere == CLP_FEASIBLE) {
if (alpha > 0.0) {
// going below
iWhere = CLP_BELOW_LOWER;
rhs = COIN_DBL_MAX;
} else {
// going above
iWhere = CLP_ABOVE_UPPER;
rhs = COIN_DBL_MAX;
}
} else if (iWhere == CLP_BELOW_LOWER) {
assert (alpha < 0);
// going feasible
iWhere = CLP_FEASIBLE;
rhs += bound_[sequence] - model_->upperRegion()[sequence];
} else {
assert (iWhere == CLP_ABOVE_UPPER);
// going feasible
iWhere = CLP_FEASIBLE;
rhs += model_->lowerRegion()[sequence] - bound_[sequence];
}
setCurrentStatus(status_[sequence], iWhere);
#ifdef NONLIN_DEBUG
assert(saveRhs1 == rhs);
#endif
returnValue = fabs(alpha) * infeasibilityWeight_;
}
return returnValue;
}
