A new geometric approach to multiobjective linear programming problems

DOI10.14708/MA.V51I1.7166MaRDI QIDQ6200041zbMATH OpenOpenAlexFDO

Authors Mustapha Kaci, Sonia Radjef

Publication date 29 February 2024

Published in Mathematica Applicanda (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2210.10829

zbMATH Keywords

linear programmingsensitivity analysismultiobjective programmingaffine geometry

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, well-posedness (49K40)

Abstract: This paper is a follow-up to a previous work where we developed a new geometric approach to sensitivity analysis. In this paper, we present a simple method to determine whether a given multiobjective linear programming problem (MOLPP) has an ideal solution (i.e. all of the objective functions are optimised simultaneously) without having to calculate the optimal value of each objective function. First, we divide the space of linear forms into a finite number of sets based on a fixed convex polygonal subset of $mathbb{R}^2$ using an equivalency relationship. All the elements from a given equivalency class have the same optimal solution. Next, we characterize the equivalence classes of the quotient set using a geometric approach to sensitivity analysis. Finally, a numerical example is given to illustrate the method.

Recommendations

• Solving multiobjective linear programming problems using ball center of polytopes
• Constructing efficient solutions structure of multiobjective linear programming
• A new approach to a multicriteria optimization problem
• On optimization over the efficient set of a multiple objective linear programming problem
• A new geometric approach for sensitivity analysis in linear programming

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3713449 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• A new geometric approach for sensitivity analysis in linear programming
• Multiobjective geometric programming problem under uncertainty
• Sensitivity analysis of grey linear programming for optimization problems
• Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients
• The set of all the possible compromises of a multi-level multi-objective linear programming problem

This page was built for publication: A new geometric approach to multiobjective linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200041)