Uses of Class
neqsim.process.util.optimizer.ParetoSolution
Packages that use ParetoSolution
Package
Description
Process optimization engine and constraint evaluation utilities.
-
Uses of ParetoSolution in neqsim.process.util.optimizer
Classes in neqsim.process.util.optimizer that implement interfaces with type arguments of type ParetoSolutionModifier and TypeClassDescriptionclassCollection of Pareto-optimal solutions forming the Pareto front.classRepresents a single solution on the Pareto front.Fields in neqsim.process.util.optimizer declared as ParetoSolutionModifier and TypeFieldDescriptionprivate final ParetoSolutionMultiObjectiveOptimizer.MultiObjectiveResult.kneePointFields in neqsim.process.util.optimizer with type parameters of type ParetoSolutionModifier and TypeFieldDescriptionprivate final List<ParetoSolution> ParetoFront.solutionsThe non-dominated solutions.Methods in neqsim.process.util.optimizer that return ParetoSolutionModifier and TypeMethodDescriptionParetoSolution.Builder.build()Build the ParetoSolution.ParetoFront.findKneePoint()Find the "knee" point on the Pareto front.private ParetoSolutionParetoFront.findKneePointHighDimensional()Find knee point for high-dimensional objectives using normalized Euclidean distance.ParetoFront.findMaximum(int objectiveIndex) Find the solution that maximizes a specific objective.ParetoFront.findMinimum(int objectiveIndex) Find the solution that minimizes a specific objective.MultiObjectiveOptimizer.MultiObjectiveResult.getKneePoint()Methods in neqsim.process.util.optimizer that return types with arguments of type ParetoSolutionModifier and TypeMethodDescriptionParetoFront.getSolutions()Get all solutions on the front.ParetoFront.getSolutionsSortedBy(int objectiveIndex, boolean ascending) Get solutions sorted by a specific objective.ParetoFront.iterator()Methods in neqsim.process.util.optimizer with parameters of type ParetoSolutionModifier and TypeMethodDescriptionbooleanParetoFront.add(ParetoSolution candidate) Add a candidate solution to the front.intParetoSolution.compareTo(ParetoSolution other) doubleParetoSolution.crowdingDistance(ParetoSolution leftNeighbor, ParetoSolution rightNeighbor, int objectiveIndex, double objectiveRange) Calculate crowding distance contribution from neighbors.doubleParetoSolution.distanceTo(ParetoSolution other) Calculate Euclidean distance to another solution in objective space.booleanParetoSolution.dominates(ParetoSolution other) Check if this solution dominates another solution.voidMultiObjectiveOptimizer.ProgressCallback.onProgress(int iteration, int totalIterations, ParetoSolution currentSolution) Called when a new solution is evaluated.