.. DO NOT EDIT.
.. THIS FILE WAS AUTOMATICALLY GENERATED BY SPHINX-GALLERY.
.. TO MAKE CHANGES, EDIT THE SOURCE PYTHON FILE:
.. "tutorials_sg/mdo/plot_gemseo_in_10_minutes.py"
.. LINE NUMBERS ARE GIVEN BELOW.

.. only:: html

    .. note::
        :class: sphx-glr-download-link-note

        Click :ref:`here <sphx_glr_download_tutorials_sg_mdo_plot_gemseo_in_10_minutes.py>`
        to download the full example code

.. rst-class:: sphx-glr-example-title

.. _sphx_glr_tutorials_sg_mdo_plot_gemseo_in_10_minutes.py:


|g| in 10 minutes
=============================
.. _gemseo_10min:

.. GENERATED FROM PYTHON SOURCE LINES 29-42

Introduction
------------

This is a short introduction to |g|, geared mainly for new users.  In this
example, we will set up a simple Multi-disciplinary Design Optimization
(:term:`MDO`) problem based on a simple analytic problem.

Imports
-------

First, we will import all the classes and functions needed for the tutorials.
The first imports (__future__ and future) enable to run the tutorial
using either a Python 2 or a Python 3 interpreter.

.. GENERATED FROM PYTHON SOURCE LINES 43-50

.. code-block:: default


    from __future__ import division, unicode_literals

    from math import exp

    from numpy import array, ones








.. GENERATED FROM PYTHON SOURCE LINES 51-53

Finally, the following functions from the |g| API are imported. They will be
used latter in order to instantiate |g| objects.

.. GENERATED FROM PYTHON SOURCE LINES 53-62

.. code-block:: default

    from gemseo.api import (
        configure_logger,
        create_design_space,
        create_discipline,
        create_scenario,
    )

    configure_logger()





.. rst-class:: sphx-glr-script-out

 Out:

 .. code-block:: none


    <RootLogger root (INFO)>



.. GENERATED FROM PYTHON SOURCE LINES 63-68

These imports enables to compute mathematical expressions, as well to
instantiate numpy arrays. Numpy arrays are used to store numerical data in
|g| at low level. If you are not confortable with using Numpy, please have a
look at the `Numpy Quickstart tutorial
<https://numpy.org/doc/stable/user/quickstart.html>`_.

.. GENERATED FROM PYTHON SOURCE LINES 71-86

A simple MDO test case: the Sellar Problem
------------------------------------------
We will consider in this example the Sellar's problem:

.. include:: /tutorials/_description/sellar_problem_definition.inc

Definition of the disciplines using Python functions
----------------------------------------------------
The Sellar's problem is composed of two :term:`disciplines <discipline>` and
an :term:`objective function`. As they are expressed analytically, it is
possible to write them as simple Python functions which take as parameters
the :term:`design variables` and the :term:`coupling variables`.  The
returned values may be the outputs of a discipline, the values of the
:term:`constraints` or the value of the objective function.  Their
definitions read:

.. GENERATED FROM PYTHON SOURCE LINES 87-109

.. code-block:: default



    def f_sellar_system(x_local=1.0, x_shared_2=3.0, y_1=1.0, y_2=1.0):
        """Objective function."""
        obj = x_local ** 2 + x_shared_2 + y_1 ** 2 + exp(-y_2)
        c_1 = 3.16 - y_1 ** 2
        c_2 = y_2 - 24.0
        return obj, c_1, c_2


    def f_sellar_1(x_local=1.0, y_2=1.0, x_shared_1=1.0, x_shared_2=3.0):
        """Function for discipline 1."""
        y_1 = (x_shared_1 ** 2 + x_shared_2 + x_local - 0.2 * y_2) ** 0.5
        return y_1


    def f_sellar_2(y_1=1.0, x_shared_1=1.0, x_shared_2=3.0):
        """Function for discipline 2."""
        y_2 = abs(y_1) + x_shared_1 + x_shared_2
        return y_2









.. GENERATED FROM PYTHON SOURCE LINES 110-118

These Python functions can be easily converted into |g|
:class:`.MDODiscipline` objects by using the :class:`.AutoPyDiscipline`
discipline. It enables the automatic wrapping of a Python function into a
|g|
:class:`.MDODiscipline` by only passing a reference to the function to be
wrapped. |g| handles the wrapping and the grammar creation under the
hood. The :class:`.AutoPyDiscipline` discipline can be instantiated using the
:func:`.create_discipline` function from the |g| :term:`API`:

.. GENERATED FROM PYTHON SOURCE LINES 118-125

.. code-block:: default


    disc_sellar_system = create_discipline("AutoPyDiscipline", py_func=f_sellar_system)

    disc_sellar_1 = create_discipline("AutoPyDiscipline", py_func=f_sellar_1)

    disc_sellar_2 = create_discipline("AutoPyDiscipline", py_func=f_sellar_2)








.. GENERATED FROM PYTHON SOURCE LINES 126-131

Note that it is possible to define the Sellar disciplines by subclassing the
:class:`.MDODiscipline` class and implementing the constuctor and the _run
method by hand. Although it would take more time, it may also provide more
flexibily and more options. This method is illustrated in the :ref:`Sellar
from scratch tutorial <sellar_from_scratch>`.

.. GENERATED FROM PYTHON SOURCE LINES 131-136

.. code-block:: default


    # We then create a list of disciplines, which will be used later to create an
    # :class:`.MDOScenario`:
    disciplines = [disc_sellar_system, disc_sellar_1, disc_sellar_2]








.. GENERATED FROM PYTHON SOURCE LINES 137-144

.. note::

   For the sake of clarity, these disciplines are overly simple.
   Yet, |g| enables the definition of much more complex disciplines,
   such as wrapping complex :term:`COTS`.
   Check out the other :ref:`tutorials <tutorials_sg>` and
   our :ref:`publications list <references>` for more information.

.. GENERATED FROM PYTHON SOURCE LINES 146-151

Definition of the design space
------------------------------
In order to define :class:`.MDOScenario`,
a :term:`design space` has to be defined by creating a :class:`.DesignSpace`
object. The design space definition reads:

.. GENERATED FROM PYTHON SOURCE LINES 151-159

.. code-block:: default


    design_space = create_design_space()
    design_space.add_variable("x_local", 1, l_b=0.0, u_b=10.0, value=ones(1))
    design_space.add_variable("x_shared_1", 1, l_b=-10, u_b=10.0, value=array([4.0]))
    design_space.add_variable("x_shared_2", 1, l_b=0.0, u_b=10.0, value=array([3.0]))
    design_space.add_variable("y_1", 1, l_b=-100.0, u_b=100.0, value=ones(1))
    design_space.add_variable("y_2", 1, l_b=-100.0, u_b=100.0, value=ones(1))








.. GENERATED FROM PYTHON SOURCE LINES 160-168

Definition of the MDO scenario
------------------------------
Once the disciplines and the design space have been defined,
we can create our MDO scenario by using the :func:`.create_scenario`
API call. In this simple example,
we are using a Multiple Disciplinary Feasible (:term:`MDF`) strategy.
The Multiple Disciplinary Analyses (:term:`MDA`) are carried out using the
Gauss-Seidel method. The scenario definition reads:

.. GENERATED FROM PYTHON SOURCE LINES 168-177

.. code-block:: default


    scenario = create_scenario(
        disciplines,
        formulation="MDF",
        main_mda_class="MDAGaussSeidel",
        objective_name="obj",
        design_space=design_space,
    )








.. GENERATED FROM PYTHON SOURCE LINES 178-202

It can be noted that neither a :term:`workflow <work flow>`
nor a :term:`dataflow <data flow>` has been defined.
By design, there is no need to explicitely define the workflow
and the dataflow in |g|:

- the workflow is determined from the MDO formulation used.
- the dataflow is determined from the variable names used in the disciplines.
  Then, it is of uttermost importance to be consistent while choosing and
  using the variable names in the disciplines.

.. warning::

   As the workflow and the dataflow are implicitely determined by |g|,
   set-up errors may easily occur. Although it is not performed
   in this example, it is strongly advised to

   - check the interfaces between the several disciplines using a N2 diagram,
   - check the MDO process using an XDSM representation

Setting the constraints
-----------------------
Most of the MDO problems are under :term:`constraints`.
In our problem, we have two inequality constraints,
and their declaration reads:

.. GENERATED FROM PYTHON SOURCE LINES 202-206

.. code-block:: default


    scenario.add_constraint("c_1", "ineq")
    scenario.add_constraint("c_2", "ineq")








.. GENERATED FROM PYTHON SOURCE LINES 207-214

Execution of the scenario
-------------------------
The scenario is now complete and ready to be executed.
When running the optimization process,
the user can choose the optimization algorithm and
the maximum number of iterations to perform.
The execution of the scenario reads:

.. GENERATED FROM PYTHON SOURCE LINES 214-217

.. code-block:: default


    scenario.execute(input_data={"max_iter": 10, "algo": "SLSQP"})





.. rst-class:: sphx-glr-script-out

 Out:

 .. code-block:: none

        INFO - 09:26:12:  
        INFO - 09:26:12: *** Start MDO Scenario execution ***
        INFO - 09:26:12: MDOScenario
        INFO - 09:26:12:    Disciplines: f_sellar_system f_sellar_1 f_sellar_2
        INFO - 09:26:12:    MDOFormulation: MDF
        INFO - 09:26:12:    Algorithm: SLSQP
        INFO - 09:26:12: Optimization problem:
        INFO - 09:26:12:    Minimize: obj(x_local, x_shared_1, x_shared_2)
        INFO - 09:26:12:    With respect to: x_local, x_shared_1, x_shared_2
        INFO - 09:26:12:    Subject to constraints:
        INFO - 09:26:12:       c_1(x_local, x_shared_1, x_shared_2) <= 0.0
        INFO - 09:26:12:       c_2(x_local, x_shared_1, x_shared_2) <= 0.0
        INFO - 09:26:12: Design Space:
        INFO - 09:26:12: +------------+-------------+-------+-------------+-------+
        INFO - 09:26:12: | name       | lower_bound | value | upper_bound | type  |
        INFO - 09:26:12: +------------+-------------+-------+-------------+-------+
        INFO - 09:26:12: | x_local    |      0      |   1   |      10     | float |
        INFO - 09:26:12: | x_shared_1 |     -10     |   4   |      10     | float |
        INFO - 09:26:12: | x_shared_2 |      0      |   3   |      10     | float |
        INFO - 09:26:12: +------------+-------------+-------+-------------+-------+
        INFO - 09:26:13: Optimization:   0%|          | 0/10 [00:00<?, ?it]
        INFO - 09:26:13: Optimization:  60%|██████    | 6/10 [00:00<00:00, 87.51 it/sec, obj=3.18]
        INFO - 09:26:13: Optimization: 100%|██████████| 10/10 [00:00<00:00, 57.33 it/sec, obj=3.18]
        INFO - 09:26:13: Optimization result:
        INFO - 09:26:13: Objective value = 3.183393986572944
        INFO - 09:26:13: The result is feasible.
        INFO - 09:26:13: Status: None
        INFO - 09:26:13: Optimizer message: Maximum number of iterations reached. GEMSEO Stopped the driver
        INFO - 09:26:13: Number of calls to the objective function by the optimizer: 12
        INFO - 09:26:13: Constraints values w.r.t. 0: 
        INFO - 09:26:13:    c_1 = -1.270095140171179e-13
        INFO - 09:26:13:    c_2 = -20.244723726270774
        INFO - 09:26:13: Design Space:
        INFO - 09:26:13: +------------+-------------+-----------------------+-------------+-------+
        INFO - 09:26:13: | name       | lower_bound |         value         | upper_bound | type  |
        INFO - 09:26:13: +------------+-------------+-----------------------+-------------+-------+
        INFO - 09:26:13: | x_local    |      0      | 2.390771513312141e-15 |      10     | float |
        INFO - 09:26:13: | x_shared_1 |     -10     |   1.977637390265674   |      10     | float |
        INFO - 09:26:13: | x_shared_2 |      0      | 3.982000538788141e-13 |      10     | float |
        INFO - 09:26:13: +------------+-------------+-----------------------+-------------+-------+
        INFO - 09:26:13: *** MDO Scenario run terminated in 0:00:00.185118 ***

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



.. GENERATED FROM PYTHON SOURCE LINES 218-268

The scenario is converged after 7 iterations.
Useful information can be found in the standard output, as shown below:

.. code:: bash

      *** Start MDO Scenario execution ***
      MDOScenario
         Disciplines: f_sellar_system f_sellar_1 f_sellar_2
         MDOFormulation: MDF
         Algorithm: SLSQP
      Optimization problem:
         Minimize: obj(x_local, x_shared_1, x_shared_2)
         With respect to: x_local, x_shared_1, x_shared_2
         Subject to constraints:
            c_1(x_local, x_shared_1, x_shared_2) <= 0.0
            c_2(x_local, x_shared_1, x_shared_2) <= 0.0
      Design Space:
      +------------+-------------+-------+-------------+-------+
      | name       | lower_bound | value | upper_bound | type  |
      +------------+-------------+-------+-------------+-------+
      | x_local    |      0      |   1   |      10     | float |
      | x_shared_1 |     -10     |   4   |      10     | float |
      | x_shared_2 |      0      |   3   |      10     | float |
      +------------+-------------+-------+-------------+-------+
      Optimization:   0%|          | 0/10 [00:00<?, ?it]
      Optimization:  70%|███████   | 7/10 [00:00<00:00, 109.54 it/sec, obj=3.18]
      Optimization result:
      Objective value = 3.1833939865673546
      The result is feasible.
      Status: 8
      Optimizer message: Positive directional derivative for linesearch
      Number of calls to the objective function by the optimizer: 8
      Constraints values w.r.t. 0:
         c_1 = 5.140776693224325e-12
         c_2 = -20.24472372627405
      Design Space:
      +------------+-------------+-------------------+-------------+-------+
      | name       | lower_bound |       value       | upper_bound | type  |
      +------------+-------------+-------------------+-------------+-------+
      | x_local    |      0      |         0         |      10     | float |
      | x_shared_1 |     -10     | 1.977637390264277 |      10     | float |
      | x_shared_2 |      0      |         0         |      10     | float |
      +------------+-------------+-------------------+-------------+-------+
      *** MDO Scenario run terminated in 0:00:00.099332 ***

.. note::

   |g| provides the user with a lot of optimization algorithms and
   options. An exhaustive list of the algorithms available in |g| can be
   found in the :ref:`gen_opt_algos` section.

.. GENERATED FROM PYTHON SOURCE LINES 270-278

Post-processing the results
---------------------------
Post-processings such as plots exhibiting the evolutions of the
objective function, the design variables or the constraints can be
extremely useful. The convergence of the objective function, design
variables and of the inequality constraints can be observed in the
following plots. Many other post-processings are available in |g| and
are described in :ref:`Post-processing <post_processing>`.

.. GENERATED FROM PYTHON SOURCE LINES 278-281

.. code-block:: default


    scenario.post_process("OptHistoryView", save=False, show=True)





.. rst-class:: sphx-glr-script-out

 Out:

 .. code-block:: none


    <gemseo.post.opt_history_view.OptHistoryView object at 0x7f61b457c880>



.. GENERATED FROM PYTHON SOURCE LINES 282-287

.. note::

   Such post-processings can be exported in PDF format,
   by setting :code:`save` to :code:`True` and potentially additional
   settings (see the :meth:`.Scenario.post_process` options).

.. GENERATED FROM PYTHON SOURCE LINES 289-295

What's next?
------------
You have completed a short introduction to |g|.  You can now look at the
:ref:`tutorials <tutorials_sg>` which exhibit more complex use-cases.  You
can also have a look at the documentation to discover the several features
and options of |g|.


.. rst-class:: sphx-glr-timing

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


.. _sphx_glr_download_tutorials_sg_mdo_plot_gemseo_in_10_minutes.py:


.. only :: html

 .. container:: sphx-glr-footer
    :class: sphx-glr-footer-example



  .. container:: sphx-glr-download sphx-glr-download-python

     :download:`Download Python source code: plot_gemseo_in_10_minutes.py <plot_gemseo_in_10_minutes.py>`



  .. container:: sphx-glr-download sphx-glr-download-jupyter

     :download:`Download Jupyter notebook: plot_gemseo_in_10_minutes.ipynb <plot_gemseo_in_10_minutes.ipynb>`


.. only:: html

 .. rst-class:: sphx-glr-signature

    `Gallery generated by Sphinx-Gallery <https://sphinx-gallery.github.io>`_