Pareto front

In this example, we illustrate the use of the ParetoFront plot on the Sobieski’s SSBJ problem.

from __future__ import absolute_import, division, print_function, unicode_literals

from future import standard_library


The first step is to import some functions from the API and a method to get the design space.

from gemseo.api import configure_logger, create_discipline, create_scenario
from gemseo.problems.sobieski.core import SobieskiProblem



Create disciplines

Then, we instantiate the disciplines of the Sobieski’s SSBJ problem: Propulsion, Aerodynamics, Structure and Mission

disciplines = create_discipline(

Create design space

We also read the design space from the SobieskiProblem.

design_space = SobieskiProblem().read_design_space()

Create and execute scenario

The next step is to build a MDO scenario in order to maximize the range, encoded ‘y_4’, with respect to the design parameters, while satisfying the inequality constraints ‘g_1’, ‘g_2’ and ‘g_3’. We can use the MDF formulation, the SLSQP optimization algorithm and a maximum number of iterations equal to 100.

scenario = create_scenario(
for constraint in ["g_1", "g_2", "g_3"]:
    scenario.add_constraint(constraint, "ineq")
scenario.execute({"algo": "SLSQP", "max_iter": 10})


{'algo': 'SLSQP', 'max_iter': 10}

Post-process scenario

Lastly, we post-process the scenario by means of the ParetoFront plot which generates a plot or a matrix of plots if there are more than 2 objectives, plots in red the locally non dominated points for the current two objectives, plots in green the globally (all objectives) Pareto optimal points.

scenario.post_process("ParetoFront", objectives=["g_3", "-y_4"], save=False, show=True)
Pareto front


< object at 0x7fc2986b1be0>

Total running time of the script: ( 0 minutes 1.107 seconds)

Gallery generated by Sphinx-Gallery