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

DOI10.1108/03684920910962678MaRDI QIDQ4932942zbMATH OpenOpenAlexFDO

Authors Mahamat Maimos, Balira O. Konfe, 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

cyberneticslinear programmingoptimization techniques

Mathematics Subject Classification ID

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

Recommendations

• A simplified MOLP algorithm: The MOLP-S procedure
• Alienor method applied to operational research
• A new approach to a multicriteria optimization problem
• A modified method for constructing efficient solutions structure of MOLP
• A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems

Cites work

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

Cited in

(2)

• Alienor method applied to operational research
• A semidefinite programming approach for solving multiobjective linear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932942)