com.numericalmethod.suanshu.optimization.problem

Interface MinimizationSolution<T>

Type Parameters:

T - the minimizer type

All Superinterfaces:

java.io.Serializable

All Known Subinterfaces:

IterativeMinimizer<S>, LPMinimizer, LPSimplexMinimizer, LPSimplexSolution, LPSolution<T>, UnivariateMinimizer.Solution

All Known Implementing Classes:

BFGS.BFGSImpl, BracketSearch.Solution, BranchAndBound, Brent.Solution, BruteForceIPMinimizer.Solution, DEOptim.Solution, Fibonacci.Solution, GaussNewton.MySteepestDescent.GaussNewtonImpl, Golden.Solution, GridSearch.Solution, HomogeneousPathFollowing.Solution, Huang.HuangImpl, LPBoundedMinimizer, LPUnboundedMinimizer, LPUnboundedMinimizerScheme2, NelderMead.Solution, NewtonRaphson.NewtonRaphsonImpl, Powell.PowellImpl, PrimalDualInteriorPoint.Solution, PrimalDualPathFollowing.Solution, QPPrimalActiveSetSolver.Solution, QuasiNewton.QuasiNewtonImpl, SimpleGridMinimizer.Solution, SimplexTable, SQPActiveSetSolver.Solution, SQPActiveSetSolverForOnlyInequalityConstraint.Solution, SteepestDescent.SteepestDescentImpl, Zangwill.ZangwillImpl

public interface MinimizationSolution<T>
extends java.io.Serializable

This is the solution to a minimization problem, OptimProblem.

Method Summary

Modifier and Type	Method and Description
T	minimizer() Get the minimizer (solution) to the minimization problem.
double	minimum() Get the (approximate) minimum found.

Method Detail

minimum

double minimum()

Get the (approximate) minimum found.

Returns:

the (approximate) minimum found

minimizer

T minimizer()

Get the minimizer (solution) to the minimization problem.

Returns:

the minimizer