A note on adapting methods for continuous global optimization to the discrete case

In this note we show that various branch and bound methods for solving continuous global optimization problems can be readily adapted to the discrete case. As an illustration, we present an algorithm for minimizing a concave function over the integers contained in a compact polyhedron. Computational experience with this algorithm is reported.

[1]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[2]  E. Balas,et al.  Maximizing a Convex Quadratic Function Subject to Linear Constraints. , 1973 .

[3]  James E. Falk,et al.  A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..

[4]  Reiner Horst,et al.  An algorithm for nonconvex programming problems , 1976, Math. Program..

[5]  Hiroshi Konno,et al.  Maximization of A convex quadratic function under linear constraints , 1976, Math. Program..

[6]  Clifford C. Petersen,et al.  An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions , 1979 .

[7]  Karla L. Hoffman,et al.  A method for globally minimizing concave functions over convex sets , 1981, Math. Program..

[8]  H. P. Benson,et al.  Algorithms for parametric nonconvex programming , 1982 .

[9]  H. P. Benson,et al.  A finite algorithm for concave minimization over a polyhedron , 1985 .

[10]  H. Tuy,et al.  A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set , 1985, Math. Oper. Res..

[11]  K. Grasse,et al.  A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization , 1986 .

[12]  James E. Falk,et al.  Concave Minimization Via Collapsing Polytopes , 1986, Oper. Res..

[13]  R. Horst,et al.  On the convergence of global methods in multiextremal optimization , 1987 .

[14]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[15]  R. Hoprst.  Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization reverse convex , 1988 .

[16]  Reiner Horst,et al.  Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems , 1988, Math. Program..

[17]  Harold P. Benson.  Separable concave minimization via partial outer approximation and branch and bound , 1990 .

[18]  Reiner Horst,et al.  Deterministic methods in constrained global optimization: Some recent advances and new fields of application , 1990 .

[19]  Nguyen V. Thoai,et al.  Concave minimization via conical partitions and polyhedral outer approximation , 1991, Math. Program..

[20]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .