6 #ifndef ClpAmplObjective_H
7 #define ClpAmplObjective_H
9 #include "ClpObjective.hpp"
10 #include "CoinPackedMatrix.hpp"
31 virtual double *
gradient(
const ClpSimplex * model,
32 const double * solution,
double & offset,
bool refresh,
33 int includeLinear = 2);
38 bool useFeasibleCosts);
46 const double * solution,
47 const double * change,
50 double & predictedObj,
53 virtual double objectiveValue(
const ClpSimplex * model,
const double * solution)
const ;
54 virtual void resize(
int newNumberColumns) ;
56 virtual void deleteSome(
int numberToDelete,
const int * which) ;
58 virtual void reallyScale(
const double * columnScale) ;
88 virtual ClpObjective *
clone()
const;
104 void * amplObjective_;
virtual ~ClpAmplObjective()
Destructor.
virtual void newXValues()
Say we have new primal solution - so may need to recompute.
virtual double reducedGradient(ClpSimplex *model, double *region, bool useFeasibleCosts)
Resize objective.
virtual double * gradient(const ClpSimplex *model, const double *solution, double &offset, bool refresh, int includeLinear=2)
Returns gradient.
virtual void resize(int newNumberColumns)
virtual double stepLength(ClpSimplex *model, const double *solution, const double *change, double maximumTheta, double ¤tObj, double &predictedObj, double &thetaObj)
Returns step length which gives minimum of objective for solution + theta * change vector up to maxim...
virtual void deleteSome(int numberToDelete, const int *which)
Delete columns in objective.
virtual void reallyScale(const double *columnScale)
Scale objective.
double * linearObjective() const
Linear objective.
virtual int markNonlinear(char *which)
Given a zeroed array sets nonlinear columns to 1.
ClpAmplObjective()
Default Constructor.
virtual ClpObjective * clone() const
Clone.
ClpAmplObjective & operator=(const ClpAmplObjective &rhs)
Assignment operator.
virtual double objectiveValue(const ClpSimplex *model, const double *solution) const
Return objective value (without any ClpModel offset) (model may be NULL)