|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
68 friend class COPBRANCHRULE;
88 const Sub *
sub()
const {
return sub_; }
107 double lBound(
int i)
const;
116 double uBound(
int i)
const;
130 virtual double xVal(
int i)
const override;
137 virtual double barXVal(
int i)
const override;
143 virtual double reco(
int i)
const override;
164 virtual int getInfeas(
int &infeasCon,
int &infeasVar,
double *bInvRow)
const override;
199 virtual void initialize();
218 virtual OPTSTAT optimize(METHOD method)
override;
237 virtual void addVars(
248 virtual void changeLBound(
int i,
double newLb)
override;
255 virtual void changeUBound(
int i,
double newUb)
override;
258 virtual void varRealloc(
int newSize);
261 virtual void conRealloc(
int newSize);
273 bool eliminable(
int i)
const;
282 return (orig2lp_[i] == -1);
292 virtual double elimVal(
int i)
const;
300 virtual double elimVal(
FSVarStat *stat,
double lb,
double ub)
const;
329 double obj(
int i)
const;
331 void rowRealloc(
int newSize);
332 void colRealloc(
int newSize);
372 orig2lp_(sub->maxVar()),
373 lp2orig_(sub->maxVar()),
374 infeasCons_(sub->maxCon(),false)
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
Implements a branching rule for setting a binary variable to its lower or upper bound.
int nOrigVar_
The number of original variables of the linear program.
Array< int > orig2lp_
After the elimination of variables the internal variables are again numbered consecutively starting w...
const Sub * sub_
A pointer to the corresponding subproblem.
Status of fixed and set variables.
STATUS
The enumeration of the statuses a variable gets from the linear program solver.
ArrayBuffer< InfeasCon * > infeasCons_
Buffer storing the infeasible constraints found be the constructor.
Implements a branching rule for modifying the lower and the upper bound of a variable.
virtual void removeCons(ArrayBuffer< int > &ind)
Removes all constraints listed in the buffer ind from the linear program.
Implements a branching rule for setting a variable to a certain value.
int trueNnz() const
Returns the number of nonzeros which are currently present in the constraint matrix of the LP-solver.
LpSub(Master *master, const Sub *sub)
The constructor.
ArrayBuffer< InfeasCon * > * infeasCon()
Returns a pointer to the buffer holding the infeasible constraints.
Implements the branching by adding a constraint to the set of active constraints.
Array< int > lp2orig_
Original number of a (non-eliminated) variable.
int trueNCol() const
Returns the number of columns which are passed to the LP-solver.
bool eliminated(int i) const
Returns true if the variable i is actually eliminated from the LP.
The parameterized class Array implements dynamic arrays of type E.
The linear program of a subproblem.
virtual double value() const
virtual bool infeasible() const
void remRows(ArrayBuffer< int > &ind)
Removes rows of the linear program.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
virtual double value() const override
Returns the objective function value of the linear program.
virtual bool infeasible() const override
double valueAdd_
The constant which has been added to the objective function value due to the elimination of variables...
The master of the optimization.