This class implements maximum infeasibility branching. More...
#include <BlisBranchStrategyBilevel.h>
Public Member Functions | |
BlisBranchStrategyBilevel () | |
Bilevel Constructor. More... | |
BlisBranchStrategyBilevel (BlisModel *model) | |
Bilevel Constructor. More... | |
virtual | ~BlisBranchStrategyBilevel () |
Destructor. More... | |
BlisBranchStrategyBilevel (const BlisBranchStrategyBilevel &) | |
Copy constructor. More... | |
virtual BcpsBranchStrategy * | clone () const |
Clone a brancing strategy. More... | |
virtual int | createCandBranchObjects (int numPassesLeft, double ub) |
Create a set of candidate branching objects. More... | |
virtual int | betterBranchObject (BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar) |
Compare branching object thisOne to bestSoFar. More... | |
![]() | |
BcpsBranchStrategy () | |
Default Constructor. More... | |
BcpsBranchStrategy (BcpsModel *m) | |
Useful Constructor. More... | |
virtual | ~BcpsBranchStrategy () |
Destructor. More... | |
int | getType () |
Get type. More... | |
void | setType (int t) |
Set type. More... | |
void | setModel (BcpsModel *m) |
Set model. More... | |
virtual void | clearBest (BcpsModel *model) |
Clear branching strategy environment before starting a new round of selecting the best branch object. More... | |
virtual BcpsBranchObject * | bestBranchObject () |
Compare branching objects in branchObjects_. More... | |
int | getNumBranchObjects () |
Set/get branching objects. More... | |
void | getNumBranchObjects (int num) |
Set/get branching objects. More... | |
BcpsBranchObject ** | getBranchObjects () |
Set/get branching objects. More... | |
void | setBranchObjects (BcpsBranchObject **obj) |
Set/get branching objects. More... | |
BcpsBranchObject * | getBestBranchObject () |
Set/get branching objects. More... | |
void | setBestBranchObject (BcpsBranchObject *ob) |
Set/get branching objects. More... | |
Private Member Functions | |
BlisBranchStrategyBilevel & | operator= (const BlisBranchStrategyBilevel &rhs) |
Illegal Assignment operator. More... | |
Additional Inherited Members | |
![]() | |
int | type_ |
Type of branching strategy. More... | |
BcpsModel * | model_ |
Pointer to model. More... | |
int | numBranchObjects_ |
Following members are used to store candidate branching objects. More... | |
BcpsBranchObject ** | branchObjects_ |
The set of candiate branching objects. More... | |
BcpsBranchObject * | bestBranchObject_ |
Following members are used to store information about best branching object found so far. More... | |
double | bestChangeUp_ |
Change up for best. More... | |
int | bestNumberUp_ |
Number of infeasibilities for up. More... | |
double | bestChangeDown_ |
Change down for best. More... | |
int | bestNumberDown_ |
Number of infeasibilities for down. More... | |
This class implements maximum infeasibility branching.
Definition at line 32 of file BlisBranchStrategyBilevel.h.
|
inline |
Bilevel Constructor.
Definition at line 42 of file BlisBranchStrategyBilevel.h.
|
inline |
Bilevel Constructor.
Definition at line 47 of file BlisBranchStrategyBilevel.h.
|
inlinevirtual |
Destructor.
Definition at line 52 of file BlisBranchStrategyBilevel.h.
BlisBranchStrategyBilevel::BlisBranchStrategyBilevel | ( | const BlisBranchStrategyBilevel & | ) |
Copy constructor.
|
private |
Illegal Assignment operator.
|
inlinevirtual |
Clone a brancing strategy.
Implements BcpsBranchStrategy.
Definition at line 58 of file BlisBranchStrategyBilevel.h.
|
virtual |
Create a set of candidate branching objects.
Reimplemented from BcpsBranchStrategy.
|
virtual |
Compare branching object thisOne to bestSoFar.
If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).
Implements BcpsBranchStrategy.