A global optimization method for a large number of variables (variant of Alienor method)

DOI10.1108/03684920510605885zbMath1130.90401OpenAlexW2089724310MaRDI QIDQ5695213

Balira O. Konfe, Titem Benneouala, Yves Cherruault

Publication date: 11 October 2005

Published in: Kybernetes (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (8)

MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS ⋮ OBTAINING OPTIMAL PARETO SOLUTIONS USING A HYBRID APPROACH COMBINING ε-CONSTRAINT AND MOMA-PLUS METHOD ⋮ A new reducing transformation for global optimization (with Alienor method) ⋮ Solving constrained global optimization problems without penalty parameters ⋮ A new “Optimization‐Preserving‐Operator” applied to global optimization ⋮ Alienor method applied to operational research ⋮ Alienor method to solve multi‐objective linear programming (MOLP) ⋮ Solving Fixed Final Time Fractional Optimal Control Problems Using the Parametric Optimization Method

Cites Work

• Unnamed Item
• Global optimization‐preserving operators
• On the minimal length curve that densifies the square
• Global optimization: A new variant of the Alienor method

This page was built for publication: A global optimization method for a large number of variables (variant of Alienor method)