Problem (Chips-n-Salsa - A Java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms)

Type Parameters:

T - The type of object used to represent candidate solutions to the problem.

All Known Subinterfaces:

IntegerCostOptimizationProblem<T>, OptimizationProblem<T>, SingleMachineSchedulingProblem

All Known Implementing Classes:

BoundMax, CostFunctionScaler, ForresterEtAl2008, GramacyLee2012, HollandRoyalRoad, IntegerCostFunctionScaler, MinimizeMakespan, MinimizeMaximumFlowtime, MinimizeMaximumLateness, MinimizeMaximumTardiness, Mix, OneMax, OneMaxAckley, PermutationInAHaystack, Plateaus, PolynomialRootFinding, Porcupine, RoyalRoad, Trap, TwoMax, TwoMaxEqualPeaks, WeightedEarlinessTardiness, WeightedFlowtime, WeightedLateness, WeightedNumberTardyJobs, WeightedSquaredTardiness, WeightedTardiness
```
public interface Problem<T extends Copyable<T>>
```
Base interface for all interfaces defining types of problems supported by the library.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`SolutionCostPair<T>`	`getSolutionCostPair(T candidate)`	Computes the cost of a candidate solution to the problem instance.

- Method Detail
  - getSolutionCostPair
```
SolutionCostPair<T> getSolutionCostPair(T candidate)
```
    Computes the cost of a candidate solution to the problem instance. The lower the cost, the more optimal the candidate solution.
    
    Parameters:
    
    candidate - The candidate solution to evaluate.
    
    Returns:
    
    A SolutionCostPair object containing the candidate solution and the cost of that candidate solution. Lower cost means better solution.