An implicit enumeration method for global optimization problems

DOI10.1016/0898-1221(91)90173-2MaRDI QIDQ2641085zbMATH OpenOpenAlexFDO

Authors Miroslav D. Asic, Vera Kovačević-Vujčić

Publication date 1991

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(91)90173-2

zbMATH Keywords

concave linearly constrained minimizationglobal optimizationimplicit enumeration methodlinear constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Review text

The authors present an implicit enumeration method for solving the global optimization problem subject to linear constraints. The method is implemented for the case of the concave linearly constrained minimization problem, and the minimization of a twice-continuously differentiable function over an n-dimensional interval. Some computational results are summarized.

Recommendations

• Piyavskij's method for solving the general global optimization problem
• Linearly constrained global optimization: a general solution algorithm with applications.
• Enumerative techniques for solving some nonconvex global optimization problems
• Global optimization under Lipschitzian constraints
• scientific article; zbMATH DE number 47153

Cites work

• An Algorithm for Separable Nonconvex Programming Problems
• An interior semi-infinite programming method
• Constrained global optimization: algorithms and applications
• Extended univariate algorithms for n-dimensional global optimization
• scientific article; zbMATH DE number 4001882 (Why is no real title available?)
• scientific article; zbMATH DE number 4048903 (Why is no real title available?)
• Methods for Global Concave Minimization: A Bibliographic Survey
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• Precision, complexity, and computational schemes of the cubic algorithms
• The cubic algorithm

Cited in

(5)

• Implicitly defined optimization problems
• TABU search methodology in global optimization
• An implicit enumeration scheme for the batch selection problem
• An Improved Implicit Enumeration Approach for Integer Programming
• Generalized algorithm for summing the enumerators of suboptimal solutions

This page was built for publication: An implicit enumeration method for global optimization problems

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