SolutionsIfc

The capacity of the sequence of solutions.

A list of solutions that are input feasible ordered by penalized objective function.

A list of solutions ordered by penalized objective function. The solutions may or may not be feasible.

Adds the solution to the solutions.

Adds all the solutions to the sequence of solutions. If the capacity is met, then the oldest (first) item is evicted and returned. Each evicted item is returned in the order of eviction.

Clears all solutions

Increases the capacity of the sequence of solutions. The default increase is to increase by defaultCapacity.

A list of solutions ordered by penalized objective function that are input feasible and have tested as response constraint feasible.

The solution with the lowest penalized objective function value. The solution may or may not be feasible.

Returns a list of solutions that are possibly the best by using the supplied comparator.

Returns a list of solutions that are possibly the best by using a PenalizedObjectiveFunctionConfidenceIntervalComparator. The basic procedure is to select the smallest or largest solution as the best dependent on the objective. Then, this procedure uses the best solution as the standard and compares all the solutions with it in a pair-wise manner. Any solutions that are considered not statistically different from the best solution are returned. The confidence interval is for each individual comparison with the best. Thus, to control the overall confidence, users will want to adjust the individual confidence interval level such that the overall confidence in the process is controlled. See the theory of related to multi-comparison discussed here The process used here is approximate.

Removes the specified element

Returns a DataFrame of the data associated with the solutions.

Returns a map of the data associated with the solutions.