## What is/are Unit Simplex?

Unit Simplex - Most evolutionary many-objective optimization (EMaO) algorithms start with a description of a number of the predefined set of reference points on a unit simplex.^{[1]}The paper deals with the numerical solution of the problem P to maximize a homogeneous polynomial over the unit simplex.

^{[2]}Numerical results from evaluating performance on synthetic solutions on a unit simplex plane and benchmark functions of MaF show that the proposed performance indicator IRNA is more sensitive to capturing diversity changes as the number of objectives increases compared to other popular indicators.

^{[3]}The system’s matrices linearly depend on uncertain parameters which belong to the unit simplex known as the uncertain space.

^{[4]}Motivated by such concerns, we introduce a novel mechanism that privatizes vectors belonging to the unit simplex.

^{[5]}Well-known MOEAs adopt the generation of uniformly distributed points on a unit simplex to construct such reference sets.

^{[6]}A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex.

^{[7]}