Package | Description |
---|---|
net.sf.tweety.arg.prob.dynamics | |
net.sf.tweety.logics.pcl.analysis | |
net.sf.tweety.math.opt | |
net.sf.tweety.math.opt.solver |
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractPAChangeOperator.prepareOptimizationProblem(PartialProbabilityAssignment ppa,
DungTheory theory,
OptimizationProblem problem,
java.util.Map<java.util.Collection<Argument>,FloatVariable> varsComp,
java.util.Map<java.util.Collection<Argument>,FloatVariable> varsSem,
java.util.Vector<Term> varsCompVector,
java.util.Vector<Term> varsSemVector) |
Modifier and Type | Method and Description |
---|---|
private OptimizationProblem |
MeanDistanceCulpabilityMeasure.getBaseProblem(PclBeliefSet beliefSet,
ProbabilisticConditional conditional,
double incVal)
Creates the base problem (without target function set) for determining both minimal
and maximal incon values.
|
Modifier and Type | Method and Description |
---|---|
protected OptimizationProblem |
OptimizationRootFinder.buildOptimizationProblem()
Builds an optimization problem for the task of root finding.
|
OptimizationProblem |
OptimizationProblem.clone() |
Modifier and Type | Method and Description |
---|---|
java.lang.String |
OpenOptSolver.getOpenOptCode(OptimizationProblem problem)
Builds the OpenOpt code for the given problem which can be interpreted
by a python.
|