Pré-Publication, Document De Travail Année : 2024

Multiple objective linear programming over the probability simplex

Résumé

This paper considers the problem of maximizing multiple linear functions over the probability simplex. A classification of feasible points is indicated. A necessary and sufficient condition for a member of each class to be an efficient solution is stated. This characterization yields a computational procedure for ascertaining whether a feasible point is efficient. The procedure does not require that candidates for efficiency be extreme points. An illustration of the procedure is offered.

Fichier principal
Vignette du fichier
2412.19598v1.pdf (200.48 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04880909 , version 1 (11-01-2025)

Licence

Identifiants

Citer

Anas Mifrani. Multiple objective linear programming over the probability simplex. 2025. ⟨hal-04880909⟩
83 Consultations
106 Téléchargements

Altmetric

Partager

  • More