COMPUTE PARETO FRONT OPTIMAL FOR A TWO-DIMENSIONAL POINT

Computes the Pareto-optimal front for a two-dimensional curve (set of (x, y) points), returning only the non-dominated points. Use this worker when you need to identify trade-off-optimal solutions in a two-objective design space.

When to use

Classification: process.

Tagged: 2d_points, curve, multi_objective, non_dominated, optimization, pareto, pareto_front.

Inputs

Label ID Type Default Required Description
Select The Curve curve vector   2-D input curve (vector of (x, y) point pairs) representing the candidate solution set from which the Pareto-optimal front will be extracted; must contain at least two columns.
Sort X Values sort_x_values text asc   Sort order for the x-axis values of the resulting Pareto front — ‘asc’ (ascending, default) or ‘desc’ (descending); controls the ordering of the returned non-dominated points.

Outputs

Label ID Type Description
curve_compute_pareto_front_optimal_output_1 curve_compute_pareto_front_optimal_output_1 keyvalue Key-value result containing the Pareto-optimal (non-dominated) points extracted from the input curve, with x and y coordinates of each front point.

Disciplines

  • data.curve.transform
  • data.statistics
  • design_exploration.optimization

Runnable example

A runnable example is registered for this worker. Open the example workflow on the d3VIEW canvas: /api/workflow/example?id=curve_compute_pareto_front_optimal


Auto-generated from transformation schema. Worker id: curve_compute_pareto_front_optimal. Schema hash: 0c3513cddc7a. Hand-curated docs in workerexamples/ override this page when present.