--- title: "Multi-objective optimization" source: "https://systems-analysis.info/eng/Multi-objective_optimization" wiki: "systems-analysis.info/eng" article: "Multi-objective_optimization" language: "en" categories: - "Category:Decision theory" - "Category:English" - "Category:Operations research" - "Category:Science" revision_id: 263 wiki_created_at: 2026-09-06T22:19:43Z wiki_modified_at: 2026-09-06T22:19:43Z downloaded_at: 2026-09-07T22:22:17Z --- # Multi-objective optimization **Multi-objective optimization** (also **multi-objective programming** or **multi-criteria optimization**) is a field of mathematical optimization that studies problems involving the simultaneous optimization of two or more objective functions (criteria), which are typically conflicting. Formally, the problem is defined as the minimization of a vector objective function over a set of feasible solutions. ## Definition and Terminology A multi-objective optimization problem is generally formulated as follows: $\min\limits_{x \in S}\{ f_{1}(x),f_{2}(x),\ldots,f_{k}(x)\}$ where $S \subseteq {\mathbb{R}}^{n}$ is the non-empty set of feasible solutions, and $f_{i}:S \rightarrow {\mathbb{R}}$ are the objective functions ($k \geq 2$)^{[\[1\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-encyclopedia-math-moo-1)}. The vector $f(x) = (f_{1}(x),\ldots,f_{k}(x))$ is called the objective vector. Unlike in scalar optimization, in a multi-objective setting, there is usually no single solution that improves the values of all criteria simultaneously. Therefore, the classical concept of an optimum is generalized using the concept of Pareto optimality^{[\[2\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-ehrgott-pareto-2)}. - **Pareto solution** (Pareto optimal or efficient solution): a feasible solution $x^{\ast} \in S$ for which there is no other solution $x \in S$ such that $f_{i}(x) \leq f_{i}(x^{\ast})$ for all $i = 1,\ldots,k$, and $f_{j}(x) < f_{j}(x^{\ast})$ for at least one index $j$^{[\[1\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-encyclopedia-math-moo-1)[\[2\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-ehrgott-pareto-2)}. In other words, a solution is Pareto optimal if no objective value can be improved without worsening at least one other objective. - **Pareto front** (or Pareto set): the set of all objective vectors corresponding to Pareto optimal solutions. - **Weakly Pareto optimal solution**: a solution $x^{\ast} \in S$ for which there is no other solution $x \in S$ such that $f_{i}(x) < f_{i}(x^{\ast})$ for all $i$. ## Key Properties and Theorems - **Weighted Sum Theorem**: In convex problems (where all functions $f_{i}(x)$ and the set $S$ are convex), any Pareto optimal solution $x^{\ast}$ is a solution to the scalar problem of minimizing the weighted sum of the criteria $\min\limits_{x \in S}\sum\limits_{i = 1}^{k}w_{i}f_{i}(x)$ for some set of non-negative weights $w_{i} \geq 0$. However, in non-convex problems, this method may fail to find certain parts of the Pareto front^{[\[3\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-marler-arora-2010-3)}. - **Karush-Kuhn-Tucker (KKT) Optimality Conditions**: The necessary optimality conditions for smooth problems are generalized to the multi-objective case. At a Pareto optimal point, there exists a non-zero set of non-negative multipliers (weights) for which the gradients of the objective functions and the active constraints are linearly dependent^{[\[4\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-miettinen-book-4)}. - **Properties of the Solution Set**: The Pareto front has several important qualitative characteristics. Its boundary is bounded by the **ideal point** (composed of the component-wise minima of all criteria) and the **nadir point** (composed of the component-wise maxima on the front)^{[\[4\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-miettinen-book-4)}. ## Examples - **Linear Problem**: Minimize $f_{1}(x) = - x_{1}$ and $f_{2}(x) = - x_{2}$ subject to the constraint $x_{1} + x_{2} \leq 1$, $x_{1},x_{2} \geq 0$. Here, improving one objective (e.g., increasing $x_{1}$) inevitably leads to the worsening of the other (decreasing $x_{2}$). The set of Pareto optimal solutions is the line segment $x_{1} + x_{2} = 1$. - **Non-convex Problem**: Minimize $f_{1}(x) = x^{2}$ and $f_{2}(x) = (x - 2)^{2}$ on the interval $\lbrack 0,2\rbrack$. The Pareto front is non-convex. The weighted sum method with positive weights cannot find solutions inside this interval (e.g., at the point $x = 1$), because the linear combination of the criteria will only reach its minimum at the extreme points $x = 0$ or $x = 2$^{[\[5\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-ehrgott-book-5)}. ## Related Concepts and Applications Multi-objective optimization is closely related to [multi-criteria decision-making (MCDM)](https://systems-analysis.info/eng/Decision_theory "Decision theory"), which studies the selection of the best alternative considering the preferences of a decision-maker. The main methods for transforming a multi-objective problem into a scalar one (scalarization) include: - **Weighted Sum Method**. - **$\varepsilon$-constraint Method**: One objective is optimized, while the others are converted into constraints of the form $f_{i}(x) \leq \varepsilon_{i}$. This method is capable of finding solutions on non-convex parts of the front^{[\[6\]](https://systems-analysis.info/eng/Multi-objective_optimization#cite_note-mavrotas-2009-6)}. Multi-objective optimization is widely used in engineering design, economics (e.g., portfolio optimization), management, and ecology. ## External links - Multi-objective optimization — Wikipedia ## See also - [Optimal solution (optimization)](https://systems-analysis.info/eng/Optimal_solution_(optimization) "Optimal solution (optimization)") - [Decision theory](https://systems-analysis.info/eng/Decision_theory "Decision theory") - [Decision-making](https://systems-analysis.info/eng/Decision-making "Decision-making") - [Operations research](https://systems-analysis.info/eng/Operations_research "Operations research") ## References 1. ↑ ^{[1.0](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-encyclopedia-math-moo_1-0)} ^{[1.1](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-encyclopedia-math-moo_1-1)} "Multi-objective optimization". *Encyclopedia of Mathematics*. [1] 2. ↑ ^{[2.0](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-ehrgott-pareto_2-0)} ^{[2.1](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-ehrgott-pareto_2-1)} Ehrgott, M. (2012). Vilfredo Pareto and Multi-objective Optimization. *Documenta Mathematica*, Extra Volume ISMP, 447–453. [2] 3. [↑](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-marler-arora-2010_3-0) Marler, R. T., & Arora, J. S. (2010). The weighted sum method for multi-objective optimization: new insights. *Structural and Multidisciplinary Optimization*, 41(6), 853-862. [3] 4. ↑ ^{[4.0](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-miettinen-book_4-0)} ^{[4.1](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-miettinen-book_4-1)} Miettinen, K. (1998). *Nonlinear Multiobjective Optimization*. Kluwer Academic Publishers. 5. [↑](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-ehrgott-book_5-0) Ehrgott, M. (2005). *Multicriteria Optimization* (2nd ed.). Springer-Verlag. 6. [↑](https://systems-analysis.info/eng/Multi-objective_optimization#cite_ref-mavrotas-2009_6-0) Mavrotas, G. (2009). Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems. *Applied Mathematics and Computation*, 213(2), 455-465. [4]