{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T18:06:43Z","timestamp":1773425203131,"version":"3.50.1"},"reference-count":13,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T00:00:00Z","timestamp":1244764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6,12]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to present an efficient algorithm to solve multi\u2010objective linear programming (MOLP) problem.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>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.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>A determinist algorithm for solving general MOLP problem contributes to research in the decision\u2010makers area.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>Some improvements could probably be obtained. In future work, other scalarized functions will be used and this algorithm's complexity will be studied.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The new algorithm can be advantageously compared with other methods To illustrate this new approach, an example is studied.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>A new algorithm is given which guarantees all efficient solutions are easily obtained in most cases.<\/jats:p><\/jats:sec>","DOI":"10.1108\/03684920910962678","type":"journal-article","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T07:03:15Z","timestamp":1246690995000},"page":"789-799","source":"Crossref","is-referenced-by-count":1,"title":["Alienor method to solve multi\u2010objective linear programming (MOLP)"],"prefix":"10.1108","volume":"38","author":[{"given":"Mahamat","family":"Maimos","sequence":"first","affiliation":[]},{"given":"Yves","family":"Cherruault","sequence":"additional","affiliation":[]},{"given":"Balira O.","family":"Konfe","sequence":"additional","affiliation":[]},{"given":"Ange\u2010gar S.","family":"Nkokolo Massamba","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022021920333717300_b1","doi-asserted-by":"crossref","unstructured":"Benneouala, T. and Cherruault, Y. (2005), \u201cAlienor method for global optimization with a large number of variables\u201d, Kybernetes, Vol. 34 Nos 7\/8, pp. 1104\u201011.","DOI":"10.1108\/03684920510605911"},{"key":"key2022021920333717300_b3","unstructured":"Cherruault, Y. (1998), Mod\u00e8les et m\u00e9thodes math\u00e9matiques pour les sciences du vivant, Presses Universitaires de France, Paris."},{"key":"key2022021920333717300_b2","unstructured":"Cherruault, Y. (1999), Optimisation: Methodes locales et globales, Presses Universitaires de France, Paris."},{"key":"key2022021920333717300_b4","unstructured":"Cherruault, Y. and Mora, G. (2005), Optimisation globale: Th\u00e9orie des courbes \u03b1\u2010denses, Economica, Paris."},{"key":"key2022021920333717300_b5","unstructured":"Konfe, B.O. (2005), Nouvelles m\u00e9thodes math\u00e9matiques Alienor et Adomian, pour la Biom\u00e9decine, th\u00e8se, l'Universit\u00e9 de Ouagadougou, Ouagadougou."},{"key":"key2022021920333717300_b6","doi-asserted-by":"crossref","unstructured":"Konfe, B.O., Cherruault, Y. and Benneouala, T. (2005a), \u201cA global optimization method for large number of variables (variant of Alienor method)\u201d, Kybernetes, Vol. 34 Nos 7\/8, pp. 1070\u201083.","DOI":"10.1108\/03684920510605885"},{"key":"key2022021920333717300_b7","doi-asserted-by":"crossref","unstructured":"Konfe, B.O., Cherruault, Y. and Som\u00e9, B. (2005b), \u201cSolving constrained global optimization problems without penalty parameters\u201d, Kybernetes, Vol. 34 Nos 7\/8, pp. 1090\u2010103.","DOI":"10.1108\/03684920510605902"},{"key":"key2022021920333717300_b8","doi-asserted-by":"crossref","unstructured":"Konfe, B.O., Cherruault, Y., Som\u00e9, B. and Benneouala, T. (2005c), \u201cA new \u2018Optimization\u2010Preserving\u2010Operateur\u2019 applied to global optimisation\u201d, Kybernetes, Vol. 34 Nos 7\/8, pp. 1112\u201024.","DOI":"10.1108\/03684920510605920"},{"key":"key2022021920333717300_b9","doi-asserted-by":"crossref","unstructured":"Mora, G., Cherruault, Y. and Benabidallah, A. (2003), \u201cGlobal optimization\u2010preserving\u2010operators\u201d, Kybernetes, Vol. 32 Nos 9\/10, pp. 1473\u201080.","DOI":"10.1108\/03684920310493369"},{"key":"key2022021920333717300_b10","unstructured":"Teghem, J. (1996), Programmation lin\u00e9aire, Editions Elipses, Paris."},{"key":"key2022021920333717300_b11","unstructured":"Vinck\u00e9, P. (1989), L'aide multicrit\u00e8re \u00e0 la d\u00e9cision, Editions Elipses, Paris."},{"key":"key2022021920333717300_b12","unstructured":"Ziadi, A. (2000), Optimization Globale: Contribution \u00e0 l'\u00e9tude de la m\u00e9thode de la transformation r\u00e9ductrice Alienor, th\u00e8se, l'Universit\u00e9 de Ferhat Abbas, Setif."},{"key":"key2022021920333717300_b13","doi-asserted-by":"crossref","unstructured":"Ziadi, A. and Cherruault, Y. (2000), \u201cGeneration of \u03b1\u2010dense curves and application to global optimization\u201d, Kybernetes, Vol. 29 No. 1, pp. 71\u201082.","DOI":"10.1108\/03684920010308871"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/03684920910962678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/03684920910962678\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/03684920910962678\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:53:38Z","timestamp":1753401218000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/38\/5\/789-799\/273396"}},"subtitle":[],"editor":[{"given":"Yves","family":"Cherruault","sequence":"first","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2009,6,12]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,6,12]]}},"alternative-id":["10.1108\/03684920910962678"],"URL":"https:\/\/doi.org\/10.1108\/03684920910962678","relation":{},"ISSN":["0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,6,12]]}}}