Article
Version 1
Preserved in Portico This version is not peer-reviewed
Finding All Efficient Solutions of an Interval Multiple Objective Linear Programming Problem
Version 1
: Received: 20 March 2024 / Approved: 21 March 2024 / Online: 21 March 2024 (13:47:52 CET)
Version 2 : Received: 27 May 2024 / Approved: 27 May 2024 / Online: 27 May 2024 (09:53:34 CEST)
Version 2 : Received: 27 May 2024 / Approved: 27 May 2024 / Online: 27 May 2024 (09:53:34 CEST)
How to cite: Van Tu, T. Finding All Efficient Solutions of an Interval Multiple Objective Linear Programming Problem. Preprints 2024, 2024031314. https://doi.org/10.20944/preprints202403.1314.v1 Van Tu, T. Finding All Efficient Solutions of an Interval Multiple Objective Linear Programming Problem. Preprints 2024, 2024031314. https://doi.org/10.20944/preprints202403.1314.v1
Abstract
In this paper, we propose a method to find all efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector. The set of all efficient solutions of an IMOLP problem can completely supply information to the decision makers in finding their most preferred solutions but, up to now, not all solutions of an IMOLP problem can be found by known methods. A numerical example is given to illustrate the working of the proposed method.
Keywords
Interval multiple objective linear programming; the efficient basic set; the efficient set
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment