com.numericalmethod.suanshu.optimization.constrained

Interface ConstrainedMinimizer<P extends ConstrainedOptimProblem,S extends MinimizationSolution<?>>

Type Parameters:

P - the optimization problem type

S - the optimization solution type

All Superinterfaces:

Minimizer<P,S>, Optimizer<P,S>, java.io.Serializable

All Known Subinterfaces:

LPSimplexSolver<P>, LPSolver<P,S>

All Known Implementing Classes:

FerrisMangasarianWrightPhase2, GomoryMixedCut, GomoryPureCut, HomogeneousPathFollowing, LPCanonicalSolver, LPTwoPhaseSolver, PenaltyMethodMinimizer, PrimalDualInteriorPoint, PrimalDualPathFollowing, QPPrimalActiveSetSolver, SimplexCuttingPlane, SQPActiveSetSolver, SQPActiveSetSolverForOnlyEqualityConstraint1, SQPActiveSetSolverForOnlyEqualityConstraint2, SQPActiveSetSolverForOnlyInequalityConstraint

public interface ConstrainedMinimizer<P extends ConstrainedOptimProblem,S extends MinimizationSolution<?>>
extends Minimizer<P,S>

A constrained minimizer solves a constrained optimization problem, namely, ConstrainedOptimProblem.

See Also:

Wikipedia: Constraint optimization

Method Summary

Methods inherited from interface com.numericalmethod.suanshu.optimization.Optimizer

solve