Introduction Page 1 Chapter 1 Introduction Constrained global optimization is concerned
with the characterization and computation of global minima or maxima of nonconvex …

This chapter reviews recent algorithmic developments in multiplicative programming. The
multiplicative programming problem is a class of minimization problems containing a …

It is shown that parametric linear programming algorithms work efficiently for a class of
nonconvex quadratic programming problems called generalized linear multiplicative …

NP-hardness of linear multiplicative programming and related problems Page 1 Journal of
Global Optimization 9: 113-l 19, 1996. @ 1996 Kluwer Academic Publishers. Printed in the …

Global optimization is one of the fastest developing fields in mathematical optimization. In
fact, an increasing number of remarkably efficient deterministic algorithms have been …

The purpose of this chapter is to present the essential elements of the theory, applications,
and solution algorithms of concave minimization. Concave minimization problems seek to …

An algorithm for solving a linear multiplicative programming problem (referred to as LMP) is
proposed. LMP minimizes the product of two linear functions subject to general linear …

This paper discusses an algorithm for generalized convex multiplicative programming
problems, a special class of nonconvex minimization problems in which the objective …

This paper addresses the minimization of the product of p convex functions on a convex set.
It is shown that this nonconvex problem can be converted to a concave minimization …

In this paper we consider the problem of finding the constrained global optimum of an
indefinite quadratic function. Since such a function may have many local optima, finding the …