Abstract
In this paper, we will propose an efficient and reliable heuristic algorithm for minimizing and maximizing the sum of three linear fractional functions over a polytope. These problems are typical nonconvex minimization problems of practical as well as theoretical importance. This algorithm uses a primal-dual parametric simplex algorithm to solve a subproblem in which the value of one linear function is fixed. A subdivision scheme is employed in the space of this linear function to obtain an approximate optimal solution of the original problem. It turns out that this algorithm is much more efficient and usually generates a better solution than existing algorithms. Also, we will develop a similar algorithm for minimizing the product of three linear fractional functions.
Similar content being viewed by others
References
Almology, Y. and Levin, O. (1969), Parametric analysis of a multi-stage stochastic shipping problem, Proceedings of the Fifth IFORS Conference, Venice, 359-370.
Avriel, M., Diewert, W.E., Schaible, S. and Zang, I. (1988), Generalized Convexity, Plenum Press.
Craver, B.D. (1988), Fractional Programming, Berlin: Heldermann Verlag.
Charnes, A. and Cooper, W. W. (1962), Programming with linear fractional functions, Naval Research Logistics 9: 181-186.
Cambini, A., Martein, L. and Schaible, S. (1989), On maximizing a sum of ratios, Journal of Information and Optimization Science, 10 (1989) 141-151.
Falk, J.E. and Palocsay, S.W. (1992), Optimizing the sum of linear fractional functions, in C.A. Floudas et al. (eds), Recent Advances in Global Optimization (221-258), Princeton, NJ: Princeton University Press.
Horst, R. and Pardalos, P. (1995), Handbook of Global Optimization, Dordrecht/Boston/London: Kluwer Academic Publishers.
Horst, R. and Tuy, H. (1995), Global Optimization: Deterministic Approaches, 3rd ed., Berlin/New York: Springer Verlag.
Konno, H. and Inori, M. (1989), Bond portfolio optimization by bilinear fractional programming, Journal of the Operations Research Society of Japan 32: 143-158.
Konno, H. and Kuno, T. (1992), Linear multiplicative programming, Mathematical Programming 56: 51-64.
Konno, H., Kuno, T. and Yajima, Y. (1994), Global minimization of a generalized convex multiplicative function, Journal of Global Optimization 4: 47-62.
Konno, H., Thach, P.T. and Tuy, H. (1997), Optimization on Low Rank Nonconvex Structures, Dordrecht/Boston/London: Kluwer Academic Publishers.
Konno, H. and Yajima, Y. (1992), Minimizing and maximizing the product of linear fractional functions, in C.A. Floudas et al. (eds), Recent Advance in Global Optimization (259-273) Princeton, NJ: Princeton University Press.
Konno, H., Yajima, Y. and Matsui, T. (1991), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Journal of Global Optimization, 1: 65-81.
Konno, H. and Yamashita, H. (1997), Minimization of the sum and the product of several linear fractional functions, Tokyo Institute of Technology, Technical Report, Department of IE & Management, (to appear in Naval Research Logistics).
Konno, H. and Watanabe, H. (1996), Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach, Journal of the Operations Research Society of Japan 39: 295-306.
Kuno, T. and Konno, H. (1991), A parametric successive underestimation method for convex multiplicative programming problems, Journal of Global Optimization 1: 267-286.
Rockafellar, R.T. and Wets, R. J.-B. (1998), Variational Analysis, Berlin/New York: Springer-Verlag.
Schaible, S. (1992), Some recent results in fractional programming, in P. Mazzolevi, (ed.), Generalized Concavity for Economic Application, Proceedings of the Workshop, held in Pisa, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Konno, H., Abe, N. Minimization of the sum of three linear fractional functions. Journal of Global Optimization 15, 419–432 (1999). https://doi.org/10.1023/A:1008376731013
Issue Date:
DOI: https://doi.org/10.1023/A:1008376731013