Package dev.nm.solver.problem

Interface OptimProblem

All Known Subinterfaces:

C2OptimProblem, ConstrainedOptimProblem, ConstrainedOptimSubProblem, ILPProblem, IPProblem, LPProblem

All Known Implementing Classes:

BoxOptimProblem, BruteForceIPProblem, C2OptimProblemImpl, ConstrainedOptimProblemImpl1, ILPNode, ILPProblemImpl1, IPProblemImpl1, LPCanonicalProblem1, LPCanonicalProblem2, LPProblemImpl1, LPRevisedSimplexSolver.Problem, LPStandardProblem, NonNegativityConstraintOptimProblem, PureILPProblem, QPProblem, SDPDualProblem, SOCPDualProblem, SOCPDualProblem1, SOCPGeneralProblem, SOCPGeneralProblem1, SOCPPortfolioProblem, SOCPPortfolioProblem1

public interface OptimProblem

This is an optimization problem that minimizes a real valued objective function, one or multi dimension. Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. In the simplest case, this means solving problems in which one seeks to minimize (or maximize) a real function by systematically choosing the values of real or integer variables from within an allowed set. The generalization of optimization theory and techniques to other formulations comprises a large area of applied mathematics. More generally, it means finding "best available" values of some objective function given a defined domain, including a variety of different types of objective functions and different types of domains.

See Also:

Wikipedia: Optimization (mathematics)

Method Summary

Modifier and Type	Method	Description
int	dimension()	Get the number of variables.
RealScalarFunction	f()	Get the objective function.

Method Detail

dimension

int dimension()

Get the number of variables.

Returns:

the number of variables.

f

RealScalarFunction f()

Get the objective function.

Returns:

the objective function