MCPcopy Create free account
hub / github.com/anyoptimization/pymoo / pareto_front

Method pareto_front

pymoo/core/problem.py:298–303  ·  view source on GitHub ↗
(self, *args, **kwargs)

Source from the content-addressed store, hash-verified

296
297 @Cache
298 def pareto_front(self, *args, **kwargs):
299 pf = self._calc_pareto_front(*args, **kwargs)
300 pf = at_least_2d_array(pf, extend_as="r")
301 if pf is not None and pf.shape[1] == 2:
302 pf = pf[np.argsort(pf[:, 0])]
303 return pf
304
305 @Cache
306 def pareto_set(self, *args, **kwargs):

Callers 15

nadir_pointMethod · 0.95
ideal_pointMethod · 0.95
animateFunction · 0.45
updateMethod · 0.45
saveMethod · 0.45
saveMethod · 0.45
_calc_pareto_frontMethod · 0.45
_calc_pareto_frontMethod · 0.45
_calc_pareto_frontMethod · 0.45
pareto_front_if_possibleFunction · 0.45
updateMethod · 0.45
doMethod · 0.45

Calls 2

_calc_pareto_frontMethod · 0.95
at_least_2d_arrayFunction · 0.90

Tested by 15

test_load_functionalFunction · 0.36
test_load_remote_kurFunction · 0.36
test_load_remote_osyFunction · 0.36
test_load_remote_dtlz6Function · 0.36
test_load_remote_ctpFunction · 0.36
test_problemsFunction · 0.36
test_pfFunction · 0.36
epsilon_caseFunction · 0.36
case_2dFunction · 0.36
case_3dFunction · 0.36