A constructive method for solving a multi-objective linear program with bounded variables
by Noureddine Khimoum; Taous Mernache; Mohand Ouamer Bibi
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 9, No. 2, 2022

Abstract: The search for an optimal solution remains a central objective in optimisation, but in many situations the optimal solution cannot be obtained in polynomial time. For this, it would sometimes be necessary to find a good solution close to the optimum that can be obtained in a reasonable time. The aim of this paper is to find an ε-efficient or efficient solution for a multi-objective linear programming problem with polyhedral constraints and bounded decision variables. For this, we define an ε-efficient solution for which a characterisation theorem is proved, and where the ε-optimality criterion is formulated simultaneously for all the objectives of the problem. By using this concept of ε-efficiency, we develop an algorithm that combines the well known Benson's procedure in multi-objective linear programming and the adaptive method elaborated for finding ε-optimal solutions in mono-objective linear programming, based on the diminution of the suboptimality estimate. The proposed algorithm is illustrated by a numerical example and finally, it is implemented in MATLAB to solve a set of generated test problems. The efficient solutions found are located on the Pareto fronts of the same test problems treated by using the well-known Gamultiobj algorithm of MATLAB optimisation tool.

Online publication date: Thu, 09-Feb-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Multicriteria Decision Making (IJMCDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com