Uses of Class
org.tweetyproject.math.term.Variable

Packages that use Variable

Package	Description
org.tweetyproject.math.opt.problem
org.tweetyproject.math.opt.rootFinder
org.tweetyproject.math.opt.solver
org.tweetyproject.math.term

Uses of Variable in org.tweetyproject.math.opt.problem

Methods in org.tweetyproject.math.opt.problem that return types with arguments of type Variable

Modifier and Type	Method	Description
Set<Variable>	ConstraintSatisfactionProblem.getVariables()	Returns all variables of this problem.
Set<Variable>	OptimizationProblem.getVariables()

Uses of Variable in org.tweetyproject.math.opt.rootFinder

Methods in org.tweetyproject.math.opt.rootFinder that return types with arguments of type Variable

Modifier and Type	Method	Description
Map<Variable,Term>	RootFinder.getStartingPoint()	Returns the starting point of this finder.
Map<Variable,Term>	BfgsRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
Map<Variable,Term>	GradientDescentRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
Map<Variable,Term>	HessianGradientDescentRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
Map<Variable,Term>	NewtonRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
abstract Map<Variable,Term>	OptimizationRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
abstract Map<Variable,Term>	RootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)	Determines the values for the variables appearing in the function such the function evaluates to zero.

Method parameters in org.tweetyproject.math.opt.rootFinder with type arguments of type Variable

Modifier and Type	Method	Description
Map<Variable,Term>	BfgsRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
Map<Variable,Term>	GradientDescentRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
Map<Variable,Term>	HessianGradientDescentRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
Map<Variable,Term>	NewtonRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
abstract Map<Variable,Term>	OptimizationRootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)
abstract Map<Variable,Term>	RootFinder.randomRoot(List<Term> functions, Map<Variable,Term> startingPoint)	Determines the values for the variables appearing in the function such the function evaluates to zero.
void	RootFinder.setStartingPoint(Map<Variable,Term> startingPoint)	sets the starting point of this root finder.

Constructor parameters in org.tweetyproject.math.opt.rootFinder with type arguments of type Variable

Modifier	Constructor	Description
	OptimizationRootFinder(List<Term> functions, Map<Variable,Term> startingPoint)	Creates a new root finder for the given starting point and the given (multi-dimensional) function
	RootFinder(List<Term> functions, Map<Variable,Term> startingPoint)	Creates a new root finder for the given starting point and the given (multi-dimensional) function

Uses of Variable in org.tweetyproject.math.opt.solver

Methods in org.tweetyproject.math.opt.solver that return types with arguments of type Variable

Modifier and Type	Method	Description
Map<Variable,Term>	IteratedLocalSearchOnConstrProb.bestNeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term t)	Return the best solution that was found and is a mutant of currSol
Map<Variable,Term>	SimulatedAnnealingOnConstrProb.chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc)
Map<Variable,Term>	StochasticLocalSearchOnConstrProb.chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc)	Return the best solution that was found and is a mutant of currSol
Map<Variable,Term>	TabuSearchOnConstrProb.chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term t)	Return the best solution that was found and is a mutant of currSol
Map<Variable,Term>	IteratedLocalSearchOnConstrProb.pertubate(Map<Variable,Term> currSol)	changes the solution drastically to escape a local minimum
Map<Variable,Term>	ApacheCommonsCMAESOptimizer.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	ApacheCommonsCMAESOptimizer.solve(Term t, int optimization_type)	Returns the variable assignment that maximizes/minimizes the given term (which only contains variables with defined upper and lower bounds).
Map<Variable,Term>	ApacheCommonsNonLinearConjugateGradientOptimizer.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	ApacheCommonsSimplex.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	BfgsSolver.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	CombinatoricsSolver.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	GlpkSolver.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	GradientDescent.solve(GeneralConstraintSatisfactionProblem constraintSatisfactionProblem)
Map<Variable,Term>	GurobiOptimizer.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	GurobiOptimizer.solve(Term t, int optimization_type)	Returns the variable assignment that maximizes/minimizes the given term (which only contains variables with defined upper and lower bounds).
Map<Variable,Term>	HessianGradientDescent.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	IteratedLocalSearchOnConstrProb.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	LagrangeSolver.solve(GeneralConstraintSatisfactionProblem prob)
Map<Variable,Term>	LpSolve.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	OctaveSqpSolver.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	SimpleGeneticOptimizationSolver.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	SimpleGeneticOptimizationSolver.solve(Term t, int optimization_objective)	Returns the variable assignment that maximizes/minimizes the given term (which only contains variables with defined upper and lower bounds).
Map<Variable,Term>	SimulatedAnnealingOnConstrProb.solve(GeneralConstraintSatisfactionProblem problem)
abstract Map<Variable,Term>	Solver.solve(GeneralConstraintSatisfactionProblem problem)	Computes a solution to the given constraint satisfaction or optimization problem, i.e.
Map<Variable,Term>	StochasticLocalSearchOnConstrProb.solve(GeneralConstraintSatisfactionProblem problem)
Map<Variable,Term>	TabuSearchOnConstrProb.solve(GeneralConstraintSatisfactionProblem problem)

Method parameters in org.tweetyproject.math.opt.solver with type arguments of type Variable

Modifier and Type	Method	Description
Map<Variable,Term>	IteratedLocalSearchOnConstrProb.bestNeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term t)	Return the best solution that was found and is a mutant of currSol
Map<Variable,Term>	SimulatedAnnealingOnConstrProb.chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc)
Map<Variable,Term>	StochasticLocalSearchOnConstrProb.chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc)	Return the best solution that was found and is a mutant of currSol
Map<Variable,Term>	TabuSearchOnConstrProb.chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term t)	Return the best solution that was found and is a mutant of currSol
double	IteratedLocalSearchOnConstrProb.evaluate(Map<Variable,Term> sol, Term minT)	Return the evaluation
Map<Variable,Term>	IteratedLocalSearchOnConstrProb.pertubate(Map<Variable,Term> currSol)	changes the solution drastically to escape a local minimum

Constructor parameters in org.tweetyproject.math.opt.solver with type arguments of type Variable

Modifier	Constructor	Description
	BfgsSolver(Map<Variable,Term> startingPoint)	Constructor
	GradientDescent(Map<Variable,Term> startingPoint)	Creates a new gradient descent solver
	HessianGradientDescent(Map<Variable,Term> startingPoint)	Constructor
	LagrangeSolver(Map<Variable,Term> startingPoint)	Creates a new Lagrange solver for the given optimization problem
	LagrangeSolver(Set<Map<Variable,Term>> startingPoints)	Creates a new Lagrange solver for the given optimization problem

Uses of Variable in org.tweetyproject.math.term

Subclasses of Variable in org.tweetyproject.math.term

Modifier and Type	Class	Description
class	BinaryVariable	This class models a binary variable as a mathematical term.
class	FloatVariable	This class models an float variable as a mathematical term.
class	IntegerVariable	This class models an integer variable as a mathematical term.

Methods in org.tweetyproject.math.term that return types with arguments of type Variable

Modifier and Type	Method	Description
Set<Variable>	AssociativeOperation.getVariables()
Set<Variable>	Constant.getVariables()
Set<Variable>	Difference.getVariables()
Set<Variable>	Fraction.getVariables()
Set<Variable>	FunctionalTerm.getVariables()
abstract Set<Variable>	Term.getVariables()	Returns all variables in this term.
Set<Variable>	Variable.getVariables()

Methods in org.tweetyproject.math.term with parameters of type Variable

Modifier and Type	Method	Description
Term	AbsoluteValue.derive(Variable v)
Term	Constant.derive(Variable v)
Term	Difference.derive(Variable v)
Term	Exp.derive(Variable v)
Term	Fraction.derive(Variable v)
Term	Logarithm.derive(Variable v)
Term	Maximum.derive(Variable v)
Term	Minimum.derive(Variable v)
Term	Power.derive(Variable v)
Term	Product.derive(Variable v)
Term	Root.derive(Variable v)
Term	Sum.derive(Variable v)
abstract Term	Term.derive(Variable v)	Differentiates the term with respect to the given variable.
Term	Variable.derive(Variable v)
boolean	AbsoluteValue.isContinuous(Variable v)
boolean	Constant.isContinuous(Variable v)
boolean	Difference.isContinuous(Variable v)
boolean	Exp.isContinuous(Variable v)
boolean	Fraction.isContinuous(Variable v)
boolean	Logarithm.isContinuous(Variable v)
boolean	Maximum.isContinuous(Variable v)
boolean	Minimum.isContinuous(Variable v)
boolean	Power.isContinuous(Variable v)
boolean	Product.isContinuous(Variable v)
boolean	Root.isContinuous(Variable v)
boolean	Sum.isContinuous(Variable v)
abstract boolean	Term.isContinuous(Variable v)	Checks whether this term is continuous in v.
boolean	Variable.isContinuous(Variable v)

Method parameters in org.tweetyproject.math.term with type arguments of type Variable

Modifier and Type	Method	Description
static List<Double>	Term.evaluateVector(List<Term> functions, Map<Variable,? extends Term> mapping)	Evaluates each function in the given list with the given values for variables.
Term	Term.replaceAllTerms(double[] values, List<Variable> variables)	Replaces terms according to the given map.