[next] [prev] [prev-tail] [tail] [up]

6.26 ABA_BOUNDBRANCHRULE Class Reference

class implements a branching rule for modifying the lower and the upper bound of a variable.

#include <boundbranchrule.h>

Inheritance diagram for ABA_BOUNDBRANCHRULE::

PIC

Public Member Functions

Private Attributes

Friends

6.26.1 Detailed Description

class implements a branching rule for modifying the lower and the upper bound of a variable.

Parameters:

int
variable_ The branching variable.
double
lBound_ The lower bound of the branching variable.
double
uBound_ The upper bound of the branching variable.

Definition at line 40 of file boundbranchrule.h.

6.26.2 Constructor & Destructor Documentation

6.26.2.1 ABA_BOUNDBRANCHRULE::ABA_BOUNDBRANCHRULE (ABA_MASTER * master, int variable, double lBound, double uBound)

The constructor.

Parameters:

master
A pointer to the corresponding master of the optimization.
variable
The branching variable.
lBound
The lower bound of the branching variable.
uBound
The upper bound of the branching variable.

6.26.2.2 virtual ABA_BOUNDBRANCHRULE::~ABA_BOUNDBRANCHRULE () [virtual]

The destructor.

6.26.3 Member Function Documentation

6.26.3.1 virtual int ABA_BOUNDBRANCHRULE::extract (ABA_SUB * sub) [virtual]

Modifies a subproblem by changing the lower and the upper bound of the branching variable.

Returns:

0 If the subproblem is successfully modified.

1 If the modification causes a contradiction.

Parameters:

sub
The subproblem being modified.

Implements ABA_BRANCHRULE.

6.26.3.2 virtual void ABA_BOUNDBRANCHRULE::extract (ABA_LPSUB * lp) [virtual]

Is overloaded to modify directly the linear programming relaxation.

This required to evaluate the quality of a branching rule.

Reimplemented from ABA_BRANCHRULE.

6.26.3.3 virtual void ABA_BOUNDBRANCHRULE::unExtract (ABA_LPSUB * lp) [virtual]

Should undo the modifictions of the linear programming relaxtion |lp|.

This function has to be redefined in a derived class, if also extract(ABA_LPSUB*) is redefined there.

Parameters:

lp
A pointer to a the linear programming relaxtion of a a subproblem.

Reimplemented from ABA_BRANCHRULE.

6.26.3.4 int ABA_BOUNDBRANCHRULE::variable () const [inline]

Returns:

The number of the branching variable.

Definition at line 134 of file boundbranchrule.h.

6.26.3.5 double ABA_BOUNDBRANCHRULE::lBound () const [inline]

Returns:

The lower bound of the branching variable.

Definition at line 139 of file boundbranchrule.h.

6.26.3.6 double ABA_BOUNDBRANCHRULE::uBound () const [inline]

Returns:

The upper bound of the branching variable.

Definition at line 144 of file boundbranchrule.h.

6.26.4 Friends And Related Function Documentation

6.26.4.1 ostream& operator<< (ostream & out, const ABA_BOUNDBRANCHRULE & rhs) [friend]

The output operator writes the branching variable together with its lower and upper bound to an output stream.

Returns:

A reference to the output stream.

Parameters:

out
The output stream.
rhs
The branch rule being output.

6.26.5 Member Data Documentation

6.26.5.1 int ABA_BOUNDBRANCHRULE::variable_ [private]

Definition at line 126 of file boundbranchrule.h.

6.26.5.2 double ABA_BOUNDBRANCHRULE::lBound_ [private]

Definition at line 127 of file boundbranchrule.h.

6.26.5.3 double ABA_BOUNDBRANCHRULE::uBound_ [private]

Definition at line 128 of file boundbranchrule.h.

6.26.5.4 double ABA_BOUNDBRANCHRULE::oldLpLBound_ [private]

Definition at line 129 of file boundbranchrule.h.

6.26.5.5 double ABA_BOUNDBRANCHRULE::oldLpUBound_ [private]

Definition at line 130 of file boundbranchrule.h.

The documentation for this class was generated from the following file:

[next] [prev] [prev-tail] [front] [up]