Optimization Problems with Evidential Linear Objective - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Approximate Reasoning Année : 2023

Optimization Problems with Evidential Linear Objective

Résumé

We investigate a general optimization problem with a linear objective in which the coefficients are uncertain and the uncertainty is represented by a belief function. We consider five common criteria to compare solutions in this setting: generalized Hurwicz, strong dominance, weak dominance, maximality and E-admissibility. We provide characterizations for the non-dominated solutions with respect to these criteria when the focal sets of the belief function are Cartesian products of compact sets. These characterizations correspond to established concepts in optimization. They make it possible to find non-dominated solutions by solving known variants of the deterministic version of the optimization problem or even, in some cases, simply by solving the deterministic version.
Fichier principal
Vignette du fichier
IJAR_HAl.pdf (388.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY NC ND - Paternité - Pas d'utilisation commerciale - Pas de modification

Dates et versions

hal-04178376 , version 1 (07-08-2023)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

Tuan-Anh Vu, Sohaib Afifi, Eric Lefèvre, Frédéric Pichon. Optimization Problems with Evidential Linear Objective. International Journal of Approximate Reasoning, 2023, 161, ⟨10.1016/j.ijar.2023.108987⟩. ⟨hal-04178376⟩

Collections

UNIV-ARTOIS LGI2A
52 Consultations
26 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More