Global Maximization of a Generalized Concave Multiplicative Function

Abstract This article presents a branch-and-bound algorithm for globally solving the problem (P) of maximizing a generalized concave multiplicative function over a compact convex set. Since problem (P) does not seem to have been studied previously, the algorithm is apparently the first algorithm to be proposed for solving this problem. It works by globally solving a problem (P1) equivalent to problem (P). The branch-and-bound search undertaken by the algorithm uses rectangular partitioning and takes place in a space which typically has a much smaller dimension than the space to which the decision variables of problem (P) belong. Convergence of the algorithm is shown; computational considerations and benefits for users of the algorithm are given. A sample problem is also solved.

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

[2]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[3]  RICCARDO CAMBINI,et al.  Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound* , 2005, J. Glob. Optim..

[4]  H. P. Benson.  Deterministic algorithms for constrained concave minimization: A unified critical survey , 1996 .

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

[6]  O. Mangasarian.  Equilibrium Points of Bimatrix Games , 1964 .

[7]  S. Schaible,et al.  4. Application of Generalized Concavity to Economics , 1988 .

[8]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[9]  James E. Falk,et al.  A linear max—min problem , 1973, Math. Program..

[10]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[11]  P. T. Thach,et al.  Optimization on Low Rank Nonconvex Structures , 1996 .

[12]  H. Tuy.  Convex analysis and global optimization , 1998 .

[13]  M. Raghavachari,et al.  On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints , 1969, Oper. Res..

[14]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[15]  Hiroshi Konno,et al.  Global minimization of a generalized convex multiplicative function , 1994, J. Glob. Optim..

[16]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[17]  Alan M. Frieze,et al.  A bilinear programming formulation of the 3-dimensional assignment problem , 1974, Math. Program..