Abstract
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avriel, M. (1976),Nonlinear Programming: Analysis and Methods, Prentice-Hall, Englewood Cliffs, NJ.
Bazaraa, M.S., Jarvis J.J., and Sherali H.D. (1990),Linear Programming and Network Flows, Second Edition, Wiley, NY.
Kuno T., Yajima Y., and Konno H. (1993), An Outer Approximation Method for Minimizing the Product of Several Convex Functions on a Convex Set,Journal of Global Optimization 3, 325–335.
Sniedovich M. (1986), C-programming and the Optimization of Pseudolinear and Additive Concave Functions,Operations Research Lettters 5(4), 185–189.
Sniedovich, M. (1988), Fractional Programming Revisited,European Journal of Operational Research 33(3) 334–341.
Sniedovich, M. (1989), Analysis of a Class of Fractional Programming Problems,Mathematical Programming 43, 329–347.
Sniedovich, M. (1992),Dynamic Programming, Marcel Dekker, New York, 1992.
Sniedovich, M., Macalalag E., and Findlay S. (1994), The Simplex Algorithm as a Global Optimizer: a C-Programming Perspective,Journal of Global Optimization,4(1), 89–109.
Steuer, R.E. (1989),Multiple Criteria Optimization: Theory, Computation, and Application, Krieger Publishing Company, Malabar, Florida.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sniedovich, M., Findlay, S. Solving a class of multiplicative programming problems via c-programming. J Glob Optim 6, 313–319 (1995). https://doi.org/10.1007/BF01099467
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01099467