Solutions
Class to support a group of solutions (each containing inputs, responses, objective fns, penalties) The solutions are naturally ordered by comparison of Solution instances based on their penalized objective functions (without regard to sampling error).
Parameters
the capacity for the solutions. Constrains the total number of solutions in-memory. The default capacity is 100. Oldest solutions are evicted first.
if true input infeasible solutions are allowed to be saved. If false, input-infeasible solutions are silently ignored. The default is false (do not allow input infeasible solutions to be saved)
Constructors
Properties
A time-ordered list of the solution, where 0 is the first (oldest) solution added, 1 is the next, etc.
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.