6 #ifndef AbcNonLinearCost_H
7 #define AbcNonLinearCost_H
10 #include "CoinPragma.hpp"
14 class CoinIndexedVector;
39 #define CLP_BELOW_LOWER 0
40 #define CLP_FEASIBLE 1
41 #define CLP_ABOVE_UPPER 2
43 #ifndef ClpNonLinearCost_H
54 status =
static_cast<unsigned char>(status & ~15);
55 status =
static_cast<unsigned char>(status | value);
59 status =
static_cast<unsigned char>(status & ~(15 << 4));
60 status =
static_cast<unsigned char>(status | (value << 4));
68 status =
static_cast<unsigned char>(status & ~(15 << 4));
69 status =
static_cast<unsigned char>(status | (
CLP_SAME << 4));
111 void checkChanged(
int numberInArray, CoinIndexedVector * update);
118 void goThru(
int numberInArray,
double multiplier,
119 const int * index,
const double * work,
123 void goBack(
int numberInArray,
const int * index,
130 void goBackAll(
const CoinIndexedVector * update);
144 double setOne(
int sequence,
double solutionValue);
148 double setOneBasic(
int iRow,
double solutionValue);
154 double nearest(
int iRow,
double solutionValue);
159 return (alpha > 0.0) ? infeasibilityWeight_ : -infeasibilityWeight_;
162 return -infeasibilityWeight_;
165 return infeasibilityWeight_;
170 double returnValue = 0.0;
171 unsigned char iStatus = status_[sequence];
190 rhs += bound_[sequence] - model_->
upperRegion()[sequence];
195 rhs += model_->
lowerRegion()[sequence] - bound_[sequence];
198 returnValue = fabs(alpha) * infeasibilityWeight_;
208 return numberInfeasibilities_;
216 return feasibleCost_;
222 return sumInfeasibilities_;
226 return largestInfeasibility_;
230 return averageTheta_;
233 averageTheta_ = value;
244 {
return (status_[sequence] >> 4);}
255 double feasibleCost_;
257 double infeasibilityWeight_;
259 double largestInfeasibility_;
261 double sumInfeasibilities_;
263 double averageTheta_;
271 int numberInfeasibilities_;
274 unsigned char * status_;
void setAverageTheta(double value)
void validate()
For debug.
double changeInCost() const
Change in cost.
double changeUpInCost(int) const
double changeDownInCost(int) const
double feasibleCost() const
Feasible cost.
AbcNonLinearCost()
Default constructor.
AbcNonLinearCost & operator=(const AbcNonLinearCost &)
void goBack(int numberInArray, const int *index, double *rhs)
Takes off last iteration (i.e.
double sumInfeasibilities() const
Sum of infeasibilities.
void refresh()
Refresh - assuming regions OK.
void setCurrentStatus(unsigned char &status, int value)
double * lowerRegion() const
void feasibleBounds()
Puts feasible bounds into lower and upper.
double * upperRegion() const
double largestInfeasibility() const
Largest infeasibility.
void goThru(int numberInArray, double multiplier, const int *index, const double *work, double *rhs)
Goes through one bound for each variable.
~AbcNonLinearCost()
Destructor.
int numberInfeasibilities() const
Number of infeasibilities.
void refreshFromPerturbed(double tolerance)
Refresh - from original.
unsigned char * statusArray() const
double setOneBasic(int iRow, double solutionValue)
Sets bounds and cost for one variable Returns change in cost May need to be inline for speed...
double changeInCost(int, double alpha) const
Returns change in cost - one down if alpha >0.0, up if <0.0 Value is current - new.
double setOne(int sequence, double solutionValue)
Sets bounds and cost for one variable Returns change in cost May need to be inline for speed...
void zapCosts()
Temporary zeroing of feasible costs.
void setChangeInCost(double value)
int currentStatus(unsigned char status)
int setOneOutgoing(int sequence, double &solutionValue)
Sets bounds and cost for outgoing variable may change value Returns direction.
int originalStatus(unsigned char status)
void refreshCosts(const double *columnCosts)
Refreshes costs always makes row costs zero.
void setSameStatus(unsigned char &status)
int getCurrentStatus(int sequence)
void setOriginalStatus(unsigned char &status, int value)
void goBackAll(const CoinIndexedVector *update)
Puts back correct infeasible costs for each variable The input indices are row indices and need conve...
void setInitialStatus(unsigned char &status)
void checkInfeasibilities(double oldTolerance=0.0)
Changes infeasible costs and computes number and cost of infeas Puts all non-basic (non free) variabl...
double feasibleReportCost() const
Feasible cost with offset and direction (i.e. for reporting)
double averageTheta() const
Average theta.
void checkChanged(int numberInArray, CoinIndexedVector *update)
Puts back correct infeasible costs for each variable The input indices are row indices and need conve...
double changeInCost(int iRow, double alpha, double &rhs)
This also updates next bound.
#define CLP_BELOW_LOWER
Trivial class to deal with non linear costs.
double nearest(int iRow, double solutionValue)
Returns nearest bound.
int * pivotVariable() const
Basic variables pivoting on which rows may be same as toExternal but may be as at invert...