choco.kernel.solver.search
Interface IObjectiveManager

All Known Implementing Classes:
IntObjectiveManager, MaxIntObjManager, MaxRealObjManager, MinIntObjManager, MinRealObjManager, RealObjectiveManager

public interface IObjectiveManager


Method Summary
 Number getBestObjectiveValue()
          v1.0 accessing the best found objective value of an optimization model (note that the objective value may not be instantiated, while all other variables are)
 Var getObjective()
           
 Number getObjectiveFloor()
          Currently best known bound on the optimal solution value of the problem.
 Number getObjectiveTarget()
          the target for the objective function: we are searching for a solution at least as good as this (tentative bound)
 Number getObjectiveValue()
          v1.0 accessing the objective value of an optimization model (note that the objective value may not be instantiated, while all other variables are)
 void incrementFloorBound()
           
 void initBounds()
          initialization of the optimization bound data structure
 boolean isTargetInfeasible()
          indicates if the target bound is infeasible, i.e. does not belong to the current objective domain.
 void postFloorBound()
          propagating the optimization cuts from the new floor bounds
 void postIncFloorBound()
           
 void postTargetBound()
          propagating the optimization cuts from the new target bounds
 void setBound()
          resetting the optimization bounds
 void setTargetBound()
          resetting the values of the target bounds (bounds for the remaining search).
 void writeObjective(Solution sol)
           
 

Method Detail

getObjective

Var getObjective()

getObjectiveValue

Number getObjectiveValue()
v1.0 accessing the objective value of an optimization model (note that the objective value may not be instantiated, while all other variables are)

Returns:
the current objective value

getBestObjectiveValue

Number getBestObjectiveValue()
v1.0 accessing the best found objective value of an optimization model (note that the objective value may not be instantiated, while all other variables are)

Returns:
the best found objective value

getObjectiveTarget

Number getObjectiveTarget()
the target for the objective function: we are searching for a solution at least as good as this (tentative bound)


getObjectiveFloor

Number getObjectiveFloor()
Currently best known bound on the optimal solution value of the problem.


writeObjective

void writeObjective(Solution sol)

initBounds

void initBounds()
initialization of the optimization bound data structure


setBound

void setBound()
resetting the optimization bounds


setTargetBound

void setTargetBound()
resetting the values of the target bounds (bounds for the remaining search).


postTargetBound

void postTargetBound()
                     throws ContradictionException
propagating the optimization cuts from the new target bounds

Throws:
ContradictionException

postFloorBound

void postFloorBound()
                    throws ContradictionException
propagating the optimization cuts from the new floor bounds

Throws:
ContradictionException

incrementFloorBound

void incrementFloorBound()

postIncFloorBound

void postIncFloorBound()
                       throws ContradictionException
Throws:
ContradictionException

isTargetInfeasible

boolean isTargetInfeasible()
indicates if the target bound is infeasible, i.e. does not belong to the current objective domain.

Returns:
true if the target bound does not belong to the objective domain, false otherwise.


Copyright © 2012. All Rights Reserved.