Emerald Login
   

Welcome guest

Article Request:
Alienor method to solve multi-objective linear programming (MOLP)

Article Information:

Title:

Alienor method to solve multi-objective linear programming (MOLP)

Author(s):

Mahamat Maimos, Yves Cherruault, Balira O. Konfe, Ange-gar S. Nkokolo Massamba

Journal:

Kybernetes

Year:

2009

Volume:

38

Issue:

5

Page:

789 - 799


ISSN:

0368-492X


DOI:

10.1108/03684920910962678

Publisher:

Emerald Group Publishing Limited

Document Access:

Existing customers:

Please login above.

Purchase this document:
Price payable: GBP £13.00
plus handling charge of GBP £1.50 and VAT where applicable.
Purchase

Request this document:
Print or e-mail a document request to your librarian.
Request

Reprints & permissions:
Image: Rightslink Request

Abstract:

Purpose – The purpose of this paper is to present an efficient algorithm to solve multi-objective linear programming (MOLP) problem.

Design/methodology/approach – This new approach consists to convert the constrained multicriteria problem into an unconstrained global optimization problem. Then, the Alienor method coupled to the optimization preserving operators* (OPO*) technique is used to solve the transformed problem.

Findings – A determinist algorithm for solving general MOLP problem contributes to research in the decision-makers area.

Research limitations/implications – Some improvements could probably be obtained. In future work, other scalarized functions will be used and this algorithm's complexity will be studied.

Practical implications – The new algorithm can be advantageously compared with other methods To illustrate this new approach, an example is studied.

Originality/value – A new algorithm is given which guarantees all efficient solutions are easily obtained in most cases.

Keywords:

Cybernetics, Linear programming, Optimization techniques


Article Type:

Research paper


Article URL:

http://www.emeraldinsight.com/10.1108/03684920910962678

Top