6 #ifndef ClpConstraintLinear_H
7 #define ClpConstraintLinear_H
32 const double * solution,
36 bool useScaling =
false,
37 bool refresh =
true)
const ;
39 virtual void resize(
int newNumberColumns) ;
41 virtual void deleteSome(
int numberToDelete,
const int * which) ;
43 virtual void reallyScale(
const double * columnScale) ;
62 const int *
column,
const double * element);
83 return numberColumns_;
102 double * coefficient_;
106 int numberCoefficients_;
virtual void deleteSome(int numberToDelete, const int *which)
Delete columns in constraint.
double offset() const
Constraint offset.
ClpConstraintLinear & operator=(const ClpConstraintLinear &rhs)
Assignment operator.
virtual int markNonlinear(char *which) const
Given a zeroed array sets nonlinear columns to 1.
const int * column() const
Columns.
Constraint Abstract Base Class.
virtual int markNonzero(char *which) const
Given a zeroed array sets possible nonzero coefficients to 1.
virtual void reallyScale(const double *columnScale)
Scale constraint.
double functionValue() const
Stored constraint function value.
virtual void resize(int newNumberColumns)
Resize constraint.
const double * coefficient() const
Coefficients.
This solves LPs using the simplex method.
int numberColumns() const
Number of columns in linear constraint.
virtual ClpConstraint * clone() const
Clone.
virtual ~ClpConstraintLinear()
Destructor.
virtual int gradient(const ClpSimplex *model, const double *solution, double *gradient, double &functionValue, double &offset, bool useScaling=false, bool refresh=true) const
Fills gradient.
ClpConstraintLinear()
Default Constructor.
virtual int numberCoefficients() const
Number of coefficients.