Sensitivity analysis of multiobjective linear programming from a geometric perspective

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Kaci, Mustapha
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916346083672064
author Kaci, Mustapha
author_facet Kaci, Mustapha
contents Sensitivity analysis plays a crucial role in multiobjective linear programming (MOLP), where understanding the impact of parameter changes on efficient solutions is essential. This work builds upon and extends previous investigations. In this paper, we introduce a novel approach to sensitivity analysis in MOLP, designed to be computationally feasible for decision-makers studying the behavior of efficient solutions under perturbations of objective function coefficients in a two-dimensional variable space. This approach classifies all MOLP problems in $S \subset \mathbb{R}^{2}$ by defining an equivalence relation that partitions the space of linear maps$-$comprising all sequences of linear forms on $\mathbb{R}^2$ of length $K \geq 2-$into a finite number of equivalence classes. Each equivalence class is associated with a unique subset of the boundary of $S$. For any MOLP with $K$ objective functions belonging to the same equivalence class, its set of efficient solutions corresponds to the associated subset of the boundary of $S$. This approach is detailed and illustrated with a numerical example.
format Preprint
id arxiv_https___arxiv_org_abs_2408_02101
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sensitivity analysis of multiobjective linear programming from a geometric perspective
Kaci, Mustapha
Optimization and Control
Sensitivity analysis plays a crucial role in multiobjective linear programming (MOLP), where understanding the impact of parameter changes on efficient solutions is essential. This work builds upon and extends previous investigations. In this paper, we introduce a novel approach to sensitivity analysis in MOLP, designed to be computationally feasible for decision-makers studying the behavior of efficient solutions under perturbations of objective function coefficients in a two-dimensional variable space. This approach classifies all MOLP problems in $S \subset \mathbb{R}^{2}$ by defining an equivalence relation that partitions the space of linear maps$-$comprising all sequences of linear forms on $\mathbb{R}^2$ of length $K \geq 2-$into a finite number of equivalence classes. Each equivalence class is associated with a unique subset of the boundary of $S$. For any MOLP with $K$ objective functions belonging to the same equivalence class, its set of efficient solutions corresponds to the associated subset of the boundary of $S$. This approach is detailed and illustrated with a numerical example.
title Sensitivity analysis of multiobjective linear programming from a geometric perspective
topic Optimization and Control
url https://arxiv.org/abs/2408.02101