Solving constrained global optimization problems without penalty parameters

DOI10.1108/03684920510605902zbMath1130.90402OpenAlexW1997298886MaRDI QIDQ5695215

Blaise Some, Balira O. Konfe, 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/03684920510605902

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (2)

Alienor method applied to operational research ⋮ Alienor method to solve multi‐objective linear programming (MOLP)

Cites Work

• A hybrid global optimization method: The multi-dimensional case
• A hybrid global optimization method: The one-dimensional case
• Global optimization‐preserving operators
• Trust Region Methods
• Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique
• A global optimization method for a large number of variables (variant of Alienor method)

This page was built for publication: Solving constrained global optimization problems without penalty parameters