scpsolver.problems
Interface ConstrainedProblem

All Superinterfaces:

Problem

All Known Implementing Classes:

LinearProgram, QuadraticProgram, StochasticProgram

public interface ConstrainedProblem
extends Problem

Description of a constrained optimization problem.

Author:

schober

Method Summary

java.util.ArrayList<Constraint>	getConstraints() Returns a list of all constrains a valid solution must keep.
boolean	isFeasable(double[] x) Determines whether all constrains are fulfilled at input value x.

Methods inherited from interface scpsolver.problems.Problem

evaluate, getDimension, getName, isMinProblem, setMinProblem

Method Detail

isFeasable

boolean isFeasable(double[] x)

Determines whether all constrains are fulfilled at input value x. isFeasable will iterate over all constrains of an optimization problem and check if all of them hold. isFeasable will then return true, otherwise it will return false.

The length of the array must be the same as the value returned by getDimension.

Parameters:

x - input variable vector

Returns:

true if all constrains hold, false otherwise

getConstraints

java.util.ArrayList<Constraint> getConstraints()

Returns a list of all constrains a valid solution must keep.

Returns:

the constrains a valid solution must keep