#include <OsiBranchingObject.hpp>
Collaboration diagram for OsiBranchingInformation:
Public Member Functions | |
| OsiBranchingInformation () | |
| Default Constructor. | |
| OsiBranchingInformation (const OsiSolverInterface *solver, bool normalSolver, bool copySolution=false) | |
| Useful Constructor (normalSolver true if has matrix etc etc) copySolution true if constructot should make a copy. | |
| OsiBranchingInformation (const OsiBranchingInformation &) | |
| Copy constructor. | |
| OsiBranchingInformation & | operator= (const OsiBranchingInformation &rhs) |
| Assignment operator. | |
| virtual OsiBranchingInformation * | clone () const |
| Clone. | |
| virtual | ~OsiBranchingInformation () |
| Destructor. | |
Public Attributes | |
| int | stateOfSearch_ |
| State of search 0 - no solution 1 - only heuristic solutions 2 - branched to a solution 3 - no solution but many nodes. | |
| double | objectiveValue_ |
| Value of objective function (in minimization sense). | |
| double | cutoff_ |
| Value of objective cutoff (in minimization sense). | |
| double | direction_ |
| Direction 1.0 for minimization, -1.0 for maximization. | |
| double | integerTolerance_ |
| Integer tolerance. | |
| double | primalTolerance_ |
| Primal tolerance. | |
| double | timeRemaining_ |
| Maximum time remaining before stopping on time. | |
| double | defaultDual_ |
| Dual to use if row bound violated (if negative then pseudoShadowPrices off). | |
| const OsiSolverInterface * | solver_ |
| Pointer to solver. | |
| int | numberColumns_ |
| The number of columns. | |
| const double * | lower_ |
| Pointer to current lower bounds on columns. | |
| const double * | solution_ |
| Pointer to current solution. | |
| const double * | upper_ |
| Pointer to current upper bounds on columns. | |
| const double * | hotstartSolution_ |
| Highly optional target (hot start) solution. | |
| const double * | pi_ |
| Pointer to duals. | |
| const double * | rowActivity_ |
| Pointer to row activity. | |
| const double * | objective_ |
| Objective. | |
| const double * | rowLower_ |
| Pointer to current lower bounds on rows. | |
| const double * | rowUpper_ |
| Pointer to current upper bounds on rows. | |
| const double * | elementByColumn_ |
| Elements in column copy of matrix. | |
| const CoinBigIndex * | columnStart_ |
| Column starts. | |
| const int * | columnLength_ |
| Column lengths. | |
| const int * | row_ |
| Row indices. | |
| double * | usefulRegion_ |
| Useful region of length CoinMax(numberColumns,2*numberRows) This is allocated and deleted before OsiObject::infeasibility It is zeroed on entry and should be so on exit It only exists if defaultDual_>=0.0. | |
| int * | indexRegion_ |
| Useful index region to go with usefulRegion_. | |
| int | numberSolutions_ |
| Number of solutions found. | |
| int | numberBranchingSolutions_ |
| Number of branching solutions found (i.e. exclude heuristics). | |
| int | depth_ |
| Depth in tree. | |
| bool | owningSolution_ |
| TEMP. | |
Definition at line 352 of file OsiBranchingObject.hpp.
| OsiBranchingInformation::OsiBranchingInformation | ( | ) |
Default Constructor.
| OsiBranchingInformation::OsiBranchingInformation | ( | const OsiSolverInterface * | solver, | |
| bool | normalSolver, | |||
| bool | copySolution = false | |||
| ) |
Useful Constructor (normalSolver true if has matrix etc etc) copySolution true if constructot should make a copy.
| OsiBranchingInformation::OsiBranchingInformation | ( | const OsiBranchingInformation & | ) |
Copy constructor.
| virtual OsiBranchingInformation::~OsiBranchingInformation | ( | ) | [virtual] |
Destructor.
| OsiBranchingInformation& OsiBranchingInformation::operator= | ( | const OsiBranchingInformation & | rhs | ) |
Assignment operator.
| virtual OsiBranchingInformation* OsiBranchingInformation::clone | ( | ) | const [virtual] |
Clone.
State of search 0 - no solution 1 - only heuristic solutions 2 - branched to a solution 3 - no solution but many nodes.
Definition at line 387 of file OsiBranchingObject.hpp.
Value of objective function (in minimization sense).
Definition at line 389 of file OsiBranchingObject.hpp.
Value of objective cutoff (in minimization sense).
Definition at line 391 of file OsiBranchingObject.hpp.
Direction 1.0 for minimization, -1.0 for maximization.
Definition at line 393 of file OsiBranchingObject.hpp.
Maximum time remaining before stopping on time.
Definition at line 399 of file OsiBranchingObject.hpp.
Dual to use if row bound violated (if negative then pseudoShadowPrices off).
Definition at line 401 of file OsiBranchingObject.hpp.
const OsiSolverInterface* OsiBranchingInformation::solver_ [mutable] |
const double* OsiBranchingInformation::lower_ [mutable] |
const double* OsiBranchingInformation::solution_ [mutable] |
const double* OsiBranchingInformation::upper_ [mutable] |
| const double* OsiBranchingInformation::hotstartSolution_ |
| const double* OsiBranchingInformation::pi_ |
| const double* OsiBranchingInformation::rowActivity_ |
| const double* OsiBranchingInformation::objective_ |
| const double* OsiBranchingInformation::rowLower_ |
| const double* OsiBranchingInformation::rowUpper_ |
| const double* OsiBranchingInformation::elementByColumn_ |
| const int* OsiBranchingInformation::columnLength_ |
| const int* OsiBranchingInformation::row_ |
Useful region of length CoinMax(numberColumns,2*numberRows) This is allocated and deleted before OsiObject::infeasibility It is zeroed on entry and should be so on exit It only exists if defaultDual_>=0.0.
Definition at line 437 of file OsiBranchingObject.hpp.
Useful index region to go with usefulRegion_.
Definition at line 439 of file OsiBranchingObject.hpp.
Number of branching solutions found (i.e. exclude heuristics).
Definition at line 443 of file OsiBranchingObject.hpp.
1.4.7