Package jline.opt.pareto

Class ParetoSweep

java.lang.Object

jline.opt.pareto.ParetoSweep

public class ParetoSweep
extends Object

Epsilon-constraint sweep for bi-objective tradeoff analysis. Solves the problem once per epsilon, each time adding constraintFactory(epsilon), and filters to the non-dominated cost frontier. Mirrors native-Python line_solver.opt.pareto.ParetoSweep.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static interface	ParetoSweep.ConstraintFactory	Maps an epsilon value to a constraint.

Constructor Summary

Constructors

Constructor	Description
ParetoSweep(OptimizationProblem problem, ParetoSweep.ConstraintFactory constraintFactory, double[] epsilons)
ParetoSweep(OptimizationProblem problem, ParetoSweep.ConstraintFactory constraintFactory, double[] epsilons, String solver)

Method Summary

Modifier and Type	Method	Description
List<ParetoPoint>	getFrontier()	Non-dominated frontier (both objective and epsilon minimized), by epsilon.
List<ParetoPoint>	getPoints()
List<ParetoPoint>	solve()
List<ParetoPoint>	solve(LineOptSolverOptions options)

Methods inherited from class java.lang.Object

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

Constructor Details

ParetoSweep

public ParetoSweep(OptimizationProblem problem,
 ParetoSweep.ConstraintFactory constraintFactory,
 double[] epsilons,
 String solver)

ParetoSweep

public ParetoSweep(OptimizationProblem problem,
 ParetoSweep.ConstraintFactory constraintFactory,
 double[] epsilons)

Method Details

getPoints

public List<ParetoPoint> getPoints()

solve

public List<ParetoPoint> solve(LineOptSolverOptions options)

solve

public List<ParetoPoint> solve()

getFrontier

public List<ParetoPoint> getFrontier()

Non-dominated frontier (both objective and epsilon minimized), by epsilon.