Constants¶
ConstrSense
¶
Bases: enum.Enum
Sense used in building constraints or linear equations.
Equal = libFlowty.FLWT_ConstrSense_Equal
class-attribute
instance-attribute
¶
Equal.
GreaterOrEqual = libFlowty.FLWT_ConstrSense_GreaterEqual
class-attribute
instance-attribute
¶
Greater than or equal.
LessOrEqual = libFlowty.FLWT_ConstrSense_LessEqual
class-attribute
instance-attribute
¶
Less than or equal.
DominanceType
¶
Bases: enum.Enum
Exact dominance critaria.
ObjSense
¶
OptimizationStatus
¶
Bases: enum.Enum
Status of the optimizations
Cutoff = libFlowty.FLWT_OptimizationStatus_Cutoff
class-attribute
instance-attribute
¶
The optimization stopped due to cutoff.
Feasible = libFlowty.FLWT_OptimizationStatus_Feasible
class-attribute
instance-attribute
¶
Stopped with a feasible solution but not necessarily optimal solution.
Infeasible = libFlowty.FLWT_OptimizationStatus_Infeasible
class-attribute
instance-attribute
¶
The problem is proven infeasible.
InfeasibleOrUnbounded = libFlowty.FLWT_OptimizationStatus_InfeasibleOrUnbounded
class-attribute
instance-attribute
¶
The problem is infeasible or unbounded.
Interrupted = libFlowty.FLWT_OptimizationStatus_Interrupted
class-attribute
instance-attribute
¶
Optimization was interrupted by user.
IterationLimit = libFlowty.FLWT_OptimizationStatus_IterationLimit
class-attribute
instance-attribute
¶
Stopped due to simplex iterations limit.
Loaded = libFlowty.FLWT_OptimizationStatus_Loaded
class-attribute
instance-attribute
¶
The problem is loaded. No optimization has run yet.
NodeLimit = libFlowty.FLWT_OptimizationStatus_NodeLimit
class-attribute
instance-attribute
¶
Stopped due to node limit.
Numeric = libFlowty.FLWT_OptimizationStatus_Numeric
class-attribute
instance-attribute
¶
Stopped due to numerical instability.
Optimal = libFlowty.FLWT_OptimizationStatus_Optimal
class-attribute
instance-attribute
¶
The problem is solved to optimality.
SolutionLimit = libFlowty.FLWT_OptimizationStatus_SolutionLimit
class-attribute
instance-attribute
¶
Stopped due to maximum solutions found.
TimeLimit = libFlowty.FLWT_OptimizationStatus_TimeLimit
class-attribute
instance-attribute
¶
Stopped due to time limit.
Unbounded = libFlowty.FLWT_OptimizationStatus_Unbounded
class-attribute
instance-attribute
¶
The problem is unbounded.
ResourceType
¶
Bases: enum.Enum
Disposable = 'D'
class-attribute
instance-attribute
¶
Disposable resource.
It is feasible to accumulate additional resource if needed in order to satisfy resource windows, e.g., waiting for a time windows to open. This type of resource is prefered compared to non-disposable resourcs, if feasible, due to performance reasons.
NonDisposable = 'N'
class-attribute
instance-attribute
¶
Non-disposable resource
It is not feasible to accumulate additional resource if needed in order to satisfy resource windows, e.g., hard time windows does not allow waiting.
VarType
¶
Where
¶
Bases: enum.Enum
Callback indicator to specify where in the algorithm the callback is invoked.
DPDominate = libFlowty.FLWT_Where_DPDominate
class-attribute
instance-attribute
¶
In the dominance phase of the dynamic programming algorithm.
DPExtend = libFlowty.FLWT_Where_DPExtend
class-attribute
instance-attribute
¶
In the extension phase of the dynamic programming algorithm.
DPInit = libFlowty.FLWT_Where_DPInit
class-attribute
instance-attribute
¶
In the initialization phase of the dynamic programming algorithm.
PathMIPCuts = libFlowty.FLWT_Where_PathMIPCuts
class-attribute
instance-attribute
¶
Apply cuts in the path MIP algorithm.
PathMIPHeuristic = libFlowty.FLWT_Where_PathMIPHeuristic
class-attribute
instance-attribute
¶
Apply primal heuristic in the path MIP algorithm.
PathMIPInit = libFlowty.FLWT_Where_PathMIPInit
class-attribute
instance-attribute
¶
Generate a set of initial paths for the path MIP algorithm.
PathMIPSolution = libFlowty.FLWT_Where_PathMIPSolution
class-attribute
instance-attribute
¶
Evaluate a primal solution in the path MIP algorithm.
PathMIPSubproblem = libFlowty.FLWT_Where_PathMIPSubproblem
class-attribute
instance-attribute
¶
Before solving the subproblem in the path MIP algorithm.