|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Problem
Basic optimization problem format.
Method Summary | |
---|---|
double |
evaluate(double[] x)
Returns the value of the function at position x . |
int |
getDimension()
Returns the dimension of the input variable space. |
java.lang.String |
getName()
Gets a string containing the type of problem that is formulated with a given instance. |
boolean |
isMinProblem()
Specifies whether the target function of this instance is to be minimized or maximized. |
void |
setMinProblem(boolean bool)
Controls if the target function is to be maximized or minimized. |
Method Detail |
---|
java.lang.String getName()
LinearProgram
class returns "Linear Program".
Please note, that this method will not return the actual name of a given instance. If you have two instances of linear programs, a method call will yield the same result. Therefore, two different linear programs cannot be distinguish via this method and must be kept apart somehow differently.
double evaluate(double[] x)
x
. The length of the array
must be the same as the value returned by getDimension
.
x
- input variable vector for the target function
x
int getDimension()
boolean isMinProblem()
true
if the target function is to be maximized, false
otherwisevoid setMinProblem(boolean bool)
bool
- true
if this function is to be minimized, false
otherwise
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |