Global optimization of nonconvex factorable programming problems

Global optimization of nonconvex factorable programming problems

0.00 Avg rating0 Votes
Article ID: iaor2002466
Country: Germany
Volume: 89
Issue: 3
Start Page Number: 459
End Page Number: 478
Publication Date: Jan 2001
Journal: Mathematical Programming
Authors: ,
Abstract:

In this paper, we consider a special class of nonconvex programming problems for which the objective function and constraints are defined in terms of general nonconvex factorable functions. We propose a branch-and-bound approach based on linear programming relaxations generated through various approximation schemes that utilize, for example, the Mean-Value Theorem and Chebyshev interpolation polynomials coordinated with a Reformulation–Linearization Technique. A suitable partitioning process is proposed that induces convergence to a global optimum. The algorithm has been implemented in C++ and some preliminary computational results are reported on a set of fifteen engineering process control and design test problems from various sources in the literature. The results indicate that the proposed procedure generates tight relaxations, even via the initial node linear program itself. Furthermore, for nine of these fifteen problems, the application of a local search method that is initialized at the LP relaxation solution produced the actual global optimum at the initial node of the enumeration tree. Moreover, for two test cases, the global optimum found improves upon the solutions previously reported in the source literature.

Reviews

Required fields are marked *. Your email address will not be published.