I. Mathematical Expression:

$$\text{SCH1}:\begin{cases} \text{Minimize }  & f_1(x)=x^2\\ \text{Minimize }  & f_2(x)=\left(x-2\right)^2\\ \text{Domain } & -\mathcal{A}\leq x\leq \mathcal{A} \end{cases}$$

where:

\(\bullet\) \(\mathcal{A}\) is a user-defined bound. In the literature, \(\mathcal{A}\) is selected between \(10\) and \(10^5\).

\(\bullet\) The Pareto-optimal solution is:

$$x^{*} \ \in \ [0,2]$$

\(\bullet\) It is a convex Pareto-optimal set:

$$f_2^{*}=\left(\sqrt{f_1^{*}}-2\right)^2$$

II. Citation Policy:

If you publish material based on databases obtained from this repository, then, in your acknowledgments, please note the assistance you received by using this repository. This will help others to obtain the same data sets and replicate your experiments. We suggest the following pseudo-APA reference format for referring to this repository:

Ali R. Al-Roomi (2016). Unconstrained Multi-Objective Benchmark Functions Repository [https://www.al-roomi.org/benchmarks/multi-objective/unconstrained-list]. Halifax, Nova Scotia, Canada: Dalhousie University, Electrical and Computer Engineering.

Here is a BiBTeX citation as well:

@MISC{Al-Roomi2016,
author = {Ali R. Al-Roomi},
title = {{Unconstrained Multi-Objective Benchmark Functions Repository}},
year = {2016},
address = {Halifax, Nova Scotia, Canada},
institution = {Dalhousie University, Electrical and Computer Engineering},
url = {https://www.al-roomi.org/benchmarks/multi-objective/unconstrained-list}
}

III. References:

[1] K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. Chichester, New York: John Wiley & Sons, 2001.
[2] Wikipedia, "Test Functions for Optimization — Wikipedia," 2016, [Online; Accessed Apr. 03, 2016]. [Online]. Available: https://en.wikipedia.org/wiki/Test_functions_for_optimization