2026-06-05T12:16:51Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/351632026-02-03T11:12:54Zcom_10630_2254col_10630_37953

00925njm 22002777a 4500 dc G.-Tóth, Boglárka author Hendrix, Eligius María Theodorus author Casado, Leocadio G. author Messine, Fréderic author 2024-07-22 We consider a simplicial branch and bound Global Optimization algorithm, where the search region is a simplex. Apart from using longest edge bisection, a simplicial partition set can be reduced due to monotonicity of the objective function. If there is a direction in which the objective function is monotone over a simplex, depending on whether the facets that may contain the minimum are at the border of the search region, we can remove the simplex completely, or reduce it to some of its border facets. Our research question deals with finding monotone directions and labeling facets of a simplex as border after longest edge bisection and reduction due to monotonicity. Experimental results are shown over a set of global optimization problems where the feasible set is defined as a simplex, and a global minimum point is located at a face of the simplicial feasible area. Tóth, B.G., Hendrix, E.M.T. , Casado, L.G and Messine, F. (2024), On dealing with minima at the border of a simplicial feasible area in simplicial Branch and Bound , Journal of Optimization Theory and Applications, 203, 1880-1909 https://hdl.handle.net/10630/35163 10.1007/s10957-024-02480-9 Programación matemática On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound.