Package net.sf.tweety.math.opt.solver

Class LagrangeSolver

java.lang.Object

net.sf.tweety.math.opt.Solver

net.sf.tweety.math.opt.solver.LagrangeSolver

public class LagrangeSolver
extends Solver

This class implements a (naive) Langrange solver for optimization problems.

This solver only considers optimization problems without inequations. The solution given by this solver is not verified as it only checks for necessary optimality conditions.

Author:

Matthias Thimm

Field Summary

Fields

Modifier and Type	Field	Description
private java.util.Set<java.util.Map<Variable,Term>>	startingPoints	The starting points for finding the optimum.
private java.util.Map<Statement,java.lang.Double>	startingPointsLMult	possible starting points for Lagrange multiplicators.

Constructor Summary

Constructors

Constructor	Description
LagrangeSolver(java.util.Map<Variable,Term> startingPoint)	Creates a new Lagrange solver for the given optimization problem
LagrangeSolver(java.util.Set<java.util.Map<Variable,Term>> startingPoints)	Creates a new Lagrange solver for the given optimization problem

Method Summary

Modifier and Type	Method	Description
static boolean	isInstalled()
void	setStartingPointsLMult(java.util.Map<Statement,java.lang.Double> startingPointsLMult)
java.util.Map<Variable,Term>	solve(ConstraintSatisfactionProblem prob)	Computes a solution to the given constraint satisfaction or optimization problem, i.e.

Methods inherited from class net.sf.tweety.math.opt.Solver

getDefaultGeneralSolver, getDefaultIntegerLinearSolver, getDefaultLinearSolver, hasDefaultGeneralSolver, hasDefaultIntegerLinearSolver, hasDefaultLinearSolver, setDefaultGeneralSolver, setDefaultIntegerLinearSolver, setDefaultLinearSolver

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

startingPoints

private java.util.Set<java.util.Map<Variable,Term>> startingPoints

The starting points for finding the optimum.

startingPointsLMult

private java.util.Map<Statement,java.lang.Double> startingPointsLMult

possible starting points for Lagrange multiplicators.

Constructor Detail

LagrangeSolver

public LagrangeSolver(java.util.Map<Variable,Term> startingPoint)

Creates a new Lagrange solver for the given optimization problem

Parameters:

startingPoint - The starting point for finding the optimum.

LagrangeSolver

public LagrangeSolver(java.util.Set<java.util.Map<Variable,Term>> startingPoints)

Creates a new Lagrange solver for the given optimization problem

Parameters:

startingPoints - Some starting points for finding the optimum.

Method Detail

setStartingPointsLMult

public void setStartingPointsLMult(java.util.Map<Statement,java.lang.Double> startingPointsLMult)

solve

public java.util.Map<Variable,Term> solve(ConstraintSatisfactionProblem prob)
                                         throws GeneralMathException

Description copied from class: Solver

Computes a solution to the given constraint satisfaction or optimization problem, i.e. a mapping from variables of the problem to terms.

Specified by:

solve in class Solver

Parameters:

prob - the actual problem

Returns:

a mapping from variables of the problem to terms.

Throws:

GeneralMathException - if something went wrong.

isInstalled

public static boolean isInstalled()
                           throws java.lang.UnsupportedOperationException

Throws:

java.lang.UnsupportedOperationException