Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Multi-Objective Optimization by Means of Pairs of Functions

Version 1 : Received: 8 December 2023 / Approved: 8 December 2023 / Online: 8 December 2023 (09:17:23 CET)

How to cite: Bosi, G.; Roberto, D.; Zuanon, M. Multi-Objective Optimization by Means of Pairs of Functions. Preprints 2023, 2023120596. https://doi.org/10.20944/preprints202312.0596.v1 Bosi, G.; Roberto, D.; Zuanon, M. Multi-Objective Optimization by Means of Pairs of Functions. Preprints 2023, 2023120596. https://doi.org/10.20944/preprints202312.0596.v1

Abstract

We introduce and discuss a generalization of the classical multi-objective optimization to pairs of functions. This procedure is referred to as bi-multi-objective optimization. A justification of this general optimization procedure is presented, related both to multi-objective optimization under ambiguity concerning individual preferences and to Pareto optimality for a family of preferences with nontransitive indifference. Incidentally, the binary relation naturally associated to a bi-multi-objective optimization problem is represented by a finite bi-multi-utility, which generalizes to the nontransitive case the classical finite multi-utility representation. An important application is presented to Markowitz portfolio selection under ambiguity concerning both the vector of returns and the covariance matrix.

Keywords

Pareto optimal elemen; Bi-multi-objective optimization; Interval order; Ambiguity; Markowitz portfolio selection

Subject

Computer Science and Mathematics, Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.