# List of problems (UDPs) available in pagmo/pygmo¶

This is the list of user defined problems (UDPs) currently provided with pagmo/pygmo. These are classes that can be used to construct a pagmo::problem (C++), or a pygmo.problem (Python), which will then provide a unified interface to access the problem’s functionalities.

In the tables below, we classify optimisation problems according to the following flags:

• S = Single-objective

• M = Multi-objective

• C = Constrained

• U = Unconstrained

• I = Integer programming

• sto = Stochastic

## Meta-problems¶

Meta-problems are UDPs that take another UDP as input, yielding a new UDP which modifies the behaviour and/or the properties of the original problem in a variety of ways.

Common Name

Docs of the C++ class

Docs of the python class

Decompose

pagmo::decompose

pygmo.decompose

Translate

pagmo::translate

pygmo.translate

Unconstrain

pagmo::unconstrain

pygmo.unconstrain

Decorator

N/A

pygmo.decorator_problem