Go to the documentation of this file.
6 #ifndef ClpQuadraticObjective_H
7 #define ClpQuadraticObjective_H
10 #include "CoinPackedMatrix.hpp"
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,
54 virtual void resize(
int newNumberColumns) ;
56 virtual void deleteSome(
int numberToDelete,
const int * which) ;
74 const CoinBigIndex * start,
75 const int * column,
const double * element,
76 int numberExtendedColumns_ = -1);
87 const int * whichColumns) ;
101 const int * whichColumns)
const;
105 const CoinBigIndex * start,
106 const int * column,
const double * element,
116 return quadraticObjective_;
124 return numberExtendedColumns_;
128 return numberColumns_;
141 CoinPackedMatrix * quadraticObjective_;
149 int numberExtendedColumns_;
This solves LPs using the simplex method.
CoinPackedMatrix * quadraticObjective() const
Quadratic objective.
virtual ClpObjective * clone() const
Clone.
Objective Abstract Base Class.
virtual void resize(int newNumberColumns)
Resize objective.
virtual ~ClpQuadraticObjective()
Destructor.
ClpQuadraticObjective(const ClpQuadraticObjective &rhs, int numberColumns, const int *whichColumns)
Subset constructor.
virtual ClpObjective * subsetClone(int numberColumns, const int *whichColumns) const
Subset clone.
virtual void deleteSome(int numberToDelete, const int *which)
Delete columns in objective.
ClpQuadraticObjective(const double *linearObjective, int numberColumns, const CoinBigIndex *start, const int *column, const double *element, int numberExtendedColumns_=-1)
Constructor from objective.
int numberExtendedColumns() const
Length of linear objective which could be bigger.
virtual int markNonlinear(char *which)
Given a zeroed array sets nonlinear columns to 1.
void loadQuadraticObjective(const int numberColumns, const CoinBigIndex *start, const int *column, const double *element, int numberExtendedColumns=-1)
Load up quadratic objective.
virtual void reallyScale(const double *columnScale)
Scale objective.
double * linearObjective() const
Linear objective.
void loadQuadraticObjective(const CoinPackedMatrix &matrix)
ClpQuadraticObjective()
Default Constructor.
ClpQuadraticObjective & operator=(const ClpQuadraticObjective &rhs)
Assignment operator.
ClpQuadraticObjective(const ClpQuadraticObjective &rhs, int type=0)
Copy constructor .
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 double reducedGradient(ClpSimplex *model, double *region, bool useFeasibleCosts)
Resize objective.
bool fullMatrix() const
If a full or half matrix.
virtual double objectiveValue(const ClpSimplex *model, const double *solution) const
Return objective value (without any ClpModel offset) (model may be NULL)
void deleteQuadraticObjective()
Get rid of quadratic objective.
int numberColumns() const
Number of columns in quadratic objective.
Quadratic Objective Class.
int type() const
Returns type (above 63 is extra information)
virtual double * gradient(const ClpSimplex *model, const double *solution, double &offset, bool refresh, int includeLinear=2)
Returns gradient.