6#ifndef AbcNonLinearCost_H
7#define AbcNonLinearCost_H
9#include "CoinPragma.hpp"
13class CoinIndexedVector;
38#define CLP_BELOW_LOWER 0
40#define CLP_ABOVE_UPPER 2
42#ifndef ClpNonLinearCost_H
53 status =
static_cast< unsigned char >(status & ~15);
54 status =
static_cast< unsigned char >(status | value);
58 status =
static_cast< unsigned char >(status & ~(15 << 4));
59 status =
static_cast< unsigned char >(status | (value << 4));
67 status =
static_cast< unsigned char >(status & ~(15 << 4));
68 status =
static_cast< unsigned char >(status | (
CLP_SAME << 4));
115 void goThru(
int numberInArray,
double multiplier,
116 const int *index,
const double *work,
120 void goBack(
int numberInArray,
const int *index,
141 double setOne(
int sequence,
double solutionValue);
151 double nearest(
int iRow,
double solutionValue);
171 double returnValue = 0.0;
172 unsigned char iStatus =
status_[sequence];
254 return (
status_[sequence] >> 4);
void setOriginalStatus(unsigned char &status, int value)
#define CLP_BELOW_LOWER
Trivial class to deal with non linear costs.
void setCurrentStatus(unsigned char &status, int value)
int currentStatus(unsigned char status)
void setSameStatus(unsigned char &status)
void setInitialStatus(unsigned char &status)
int originalStatus(unsigned char status)
double infeasibilityWeight_
Current infeasibility weight.
double changeCost_
Change in cost because of infeasibilities.
void checkChanged(int numberInArray, CoinIndexedVector *update)
Puts back correct infeasible costs for each variable The input indices are row indices and need conve...
void checkInfeasibilities(int numberInArray, const int *index)
Changes infeasible costs for each variable The indices are row indices and need converting to sequenc...
double feasibleCost() const
Feasible cost.
double changeDownInCost(int) const
AbcNonLinearCost()
Default constructor.
double sumInfeasibilities() const
Sum of infeasibilities.
void refreshCosts(const double *columnCosts)
Refreshes costs always makes row costs zero.
int numberInfeasibilities_
Number of infeasibilities found.
void zapCosts()
Temporary zeroing of feasible costs.
double changeUpInCost(int) const
double feasibleReportCost() const
Feasible cost with offset and direction (i.e. for reporting)
void feasibleBounds()
Puts feasible bounds into lower and upper.
double setOneBasic(int iRow, double solutionValue)
Sets bounds and cost for one variable Returns change in cost May need to be inline for speed.
void setChangeInCost(double value)
double averageTheta_
Average theta - kept here as only for primal.
double largestInfeasibility() const
Largest infeasibility.
unsigned char * status_
Contains status at beginning and current.
double nearest(int iRow, double solutionValue)
Returns nearest bound.
void checkInfeasibilities(double oldTolerance=0.0)
Changes infeasible costs and computes number and cost of infeas Puts all non-basic (non free) variabl...
int numberColumns_
Number of columns (mainly for checking and copy)
void refreshFromPerturbed(double tolerance)
Refresh - from original.
int numberRows_
Number of rows (mainly for checking and copy)
double changeInCost(int, double alpha) const
Returns change in cost - one down if alpha >0.0, up if <0.0 Value is current - new.
int setOneOutgoing(int sequence, double &solutionValue)
Sets bounds and cost for outgoing variable may change value Returns direction.
void validate()
For debug.
double * cost_
Feasible cost array.
AbcNonLinearCost(AbcSimplex *model)
Constructor from simplex.
~AbcNonLinearCost()
Destructor.
double changeInCost(int iRow, double alpha, double &rhs)
This also updates next bound.
double * bound_
Bound which has been replaced in lower_ or upper_.
double changeInCost() const
Change in cost.
void goBack(int numberInArray, const int *index, double *rhs)
Takes off last iteration (i.e.
int getCurrentStatus(int sequence)
double averageTheta() const
Average theta.
AbcNonLinearCost(const AbcNonLinearCost &)
int numberInfeasibilities() const
Number of infeasibilities.
double sumInfeasibilities_
Sum of infeasibilities.
double setOne(int sequence, double solutionValue)
Sets bounds and cost for one variable Returns change in cost May need to be inline for speed.
double largestInfeasibility_
Largest infeasibility.
double feasibleCost_
Feasible cost.
void refresh()
Refresh - assuming regions OK.
void goThru(int numberInArray, double multiplier, const int *index, const double *work, double *rhs)
Goes through one bound for each variable.
AbcSimplex * model_
Model.
AbcNonLinearCost & operator=(const AbcNonLinearCost &)
void goBackAll(const CoinIndexedVector *update)
Puts back correct infeasible costs for each variable The input indices are row indices and need conve...
unsigned char * statusArray() const
void setAverageTheta(double value)
double * upperRegion() const
int * pivotVariable() const
Basic variables pivoting on which rows may be same as toExternal but may be as at invert.
double * lowerRegion() const