Classes | |
| class | AlgorithmParameter |
| Represents one named parameter used by a solution-generation method. More... | |
Enumerations | |
| enum | FeasibilityStatus { NotEvaluated , PartiallyEvaluated , Feasible , Infeasible } |
| Indicates the evaluated feasibility status of a lot-sizing solution candidate. More... | |
| enum | OptimalityStatus { NotEvaluated , NoProof , ProvenOptimal } |
| Indicates the available information about the optimality of a lot-sizing solution. More... | |
| enum | SolutionCompleteness { Unknown , Partial , Complete } |
| Indicates whether a lot-sizing solution contains all decision values expected for its associated instance. More... | |
| enum | SolutionMethodKind { Unknown , ExactOptimization , ConstructiveHeuristic , LocalSearch , Metaheuristic , Matheuristic , SimulationOptimization , MachineLearning , Manual , Imported , Other } |
| Identifies the general type of method used to generate a lot-sizing solution. More... | |
| enum | TerminationReason { Unknown , Completed , OptimalityProven , TargetReached , TimeLimit , IterationLimit , EvaluationLimit , NoImprovement , ResourceLimit , UserInterrupted , Error } |
| Identifies the reason why a solution-generation execution was terminated. More... | |
Indicates the evaluated feasibility status of a lot-sizing solution candidate.
This status describes whether the solution satisfies the constraints of its associated instance. It is independent of the method used to generate the solution and of any optimality information.
Definition at line 18 of file FeasibilityStatus.cs.
Indicates the available information about the optimality of a lot-sizing solution.
A feasible solution is not necessarily optimal. Heuristic and metaheuristic methods generally produce solutions without an optimality proof.
Definition at line 17 of file OptimalityStatus.cs.
Indicates whether a lot-sizing solution contains all decision values expected for its associated instance.
Completeness is independent of feasibility and optimality. A complete solution may be infeasible, while a partial solution may contain valid values for the decisions that are present.
Definition at line 17 of file SolutionCompleteness.cs.
Identifies the general type of method used to generate a lot-sizing solution.
This classification is independent of any specific solver, software implementation or algorithm.
Definition at line 16 of file SolutionMethodKind.cs.
Identifies the reason why a solution-generation execution was terminated.
The termination reason is independent of the feasibility, completeness and optimality of the generated solution.
Definition at line 16 of file TerminationReason.cs.