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

DOI10.1108/03684920910962678zbMath1198.49029OpenAlexW1998914375MaRDI QIDQ4932942

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

Publication date: 7 October 2010

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920910962678

zbMATH Keywords

linear programmingoptimization techniquescybernetics

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear optimal control problems (49N05)

Cites Work

• Global optimization‐preserving operators
• Generation of α‐dense curves and application to global optimization
• A global optimization method for a large number of variables (variant of Alienor method)
• Solving constrained global optimization problems without penalty parameters
• Alienor method for global optimization with a large number of variables
• A new “Optimization‐Preserving‐Operator” applied to global optimization

This page was built for publication: Alienor method to solve multi‐objective linear programming (MOLP)