Abstract
In this paper, we introduce a class of minimization problems whose objective function is the composite of an isotonic function and finitely many ratios. Examples of an isotonic function include the max-operator, summation, and many others, so it implies a much wider class than the classical fractional programming containing the minimax fractional program as well as the sum-of-ratios problem. Our intention is to develop a generic “Dinkelbach-like” algorithm suitable for all fractional programs of this type. Such an attempt has never been successful before, including an early effort for the sum-of-ratios problem. The difficulty is now overcome by extending the cutting plane method of Barros and Frenk (in J. Optim. Theory Appl. 87:103–120, 1995). Based on different isotonic operators, various cuts can be created respectively to either render a Dinkelbach-like approach for the sum-of-ratios problem or recover the classical Dinkelbach-type algorithm for the min-max fractional programming.
Similar content being viewed by others
References
Barros, A.I., Frenk, J.B.G.: Generalized fractional programming and cutting plane algorithms. J. Optim. Theory Appl. 87, 103–120 (1995)
Barros, A.I., Frenk, J.B.G., Schaible, S., Zhang, S.: A new algorithm for generalized fractional programs. Math. Program. 72, 147–175 (1996)
Gwinner, J., Jeyakumar, V.: A solvability theorem and minimax fractional programming. Z. Oper. Res. 37(1), 1–12 (1993)
Crouzeix, J.P., Ferland, J.A., Schaible, S.: An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47, 35–49 (1985)
Falk, J.E., Palocsay, S.W.: Optimizing the sum of linear fractional functions. In: Recent Advances in Global Optimization, Princeton, NJ, 1991. Princeton Series in Computer Science, vol. 44, pp. 221–258. Princeton University Press, Princeton (1992)
Konno, H., Fukaishi, K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Glob. Optim. 18(3), 283–299 (2000)
Benson, H.P.: Global optimization of nonlinear sums of ratios. J. Math. Anal. Appl. 263(1), 301–315 (2001)
Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19(1), 83–102 (2001)
Benson, H.P.: Global optimization algorithm for the nonlinear sum of ratios problem. J. Optim. Theory Appl. 112(1), 1–29 (2002)
Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22(1–4), 343–364 (2002). Dedicated to Professor Reiner Horst on his 60th birthday
Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22(1–4), 155–174 (2002). Dedicated to Professor Reiner Horst on his 60th birthday
Stancu-Minasian, I.: Fractional Programming: Theory, Methods and Application. Kluwer Academic, Amsterdam (1992)
Auslender, A.: Penalty and barrier methods: a unified framework. SIAM J. Optim. 10, 211–230 (1999)
Crouzeix, J.P., Ferland, J.A., Schaible, S.: A note on an algorithm for generalized fractional programs. J. Optim. Theory Appl. 50, 183–187 (1986)
Almogy, Y., Levin, O.: A class of fractional programming problems. Oper. Res. 19, 57–61 (1971)
Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13, 492–498 (1967)
Ibaraki, T.: Parametric approaches to fractional programs. Math. Program. 26, 345–362 (1983)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, JY., Schaible, S. & Sheu, RL. Minimization of Isotonic Functions Composed of Fractions. J Optim Theory Appl 146, 581–601 (2010). https://doi.org/10.1007/s10957-010-9684-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-010-9684-3