Solving the Sum-of-Ratios Problem by an Interior-Point Method

• Aurenhammer, F. (1991), Voronoi diagrams-a survey of a fundamental geometric data structure, ACM Computing Surveys 23: 345-405.

  Google Scholar 

• Cambini, A., Martein, L. and Schaible, S. (1989), On maximizing a sum of ratios, J. Information and Optimization Sciences 10: 65-79.

  Google Scholar 

• Charnes, A. and Cooper, W.W. (1962), Programming with linear fractional functionals,Naval Research Logistics Quarterly 9: 181-186.

  Google Scholar 

• Chen, D.Z., Daescu, O., Dai, Y., Katoh, N., Wu, X. and Xu, J. (1998), Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications, Technical Report, Department of Computer Science, University of Notre Dame, Notre Dame, IN.

  Google Scholar 

• Falk, J.E. and Palocsay, S.W. (1992), Optimizing the sum of linear fractional functions, in: C.A. Floudas and P.M. Pardalos (eds.), Recent Advances in Global Optimization, Princeton University Press, Princeton, NJ, pp. 221-258.

  Google Scholar 

• Fortune, S.J. (1997), Voronoi diagrams and Delaunay triangulations, in: J.E. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, pp. 377-388.

  Google Scholar 

• Freund, R.W. and Jarre, F. (1994), An interior-point method for fractional programs with convex constraints, Mathematical Programming 67: 407-440.

  Google Scholar 

• Freund, R.W. and Jarre, F. (1995), An interior-point method for multifractional programs with convex constraints, J. Optimization Theory and Applications 85: 125-161.

  Google Scholar 

• Freund, R.W., Jarre, F. and Schaible, S. (1996), On self-concordant barrier functions for conic hulls and fractional programming, Mathematical Programming 74: 237-246.

  Google Scholar 

• Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, NY.

  Google Scholar 

• Hirche, J. (1985), Some remarks on generalized convexity of sums and products, Zeitschrift für Angewandte Mathematik und Mechanik 65: 62-63.

  Google Scholar 

• Hiriart-Urruty, J.-B. and Lemarechal, C. (1993), Convex Analysis and Minimization Algorithms I, Grundlehren der Mathematischen Wissenschaften 305, Springer-Verlag, Berlin, Germany.

  Google Scholar 

• Jarre, F. and Saunders, M.A. (1995), A practical interior-point method for convex programming, SIAM J. Optimization 5: 149-171.

  Google Scholar 

• Konno, H. and Kuno, T. (1990), Generalized linear multiplicative and fractional programming, Annals of Operations Research 25: 147-161.

  Google Scholar 

• Konno, H. and Yamashita, H. (1998), Minimization of the sum and the product of several linear fractional functions over a polytope, Manuscript, Department of Industrial Engineering and Management, Tokyo Institute of Technology, Tokyo, Japan.

  Google Scholar 

• Nemirovskii, A. (1996), On polynomiality of the method of analytic centers for fractional problems, Mathematical Programming 73: 175-198.

  Google Scholar 

• Nesterov, Y. and Nemirovskii, A. (1994), Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics Vol. 13, SIAM, Philadelphia, PA.

• Ritter, K. (1967), A parametric method for solving certain nonconcave maximization problems, J. Computer and System Sciences 1: 44-54.

  Google Scholar 

• Schaible, S. (1984), Simultaneous optimization of absolute and relative terms, Zeitschrift für Angewandte Mathematik und Mechanik 64: 363-364.

  Google Scholar 

• Schaible, S. (1995), Fractional programming, in: R. Horst and P.M. Pardalos (eds.), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 495-608.

  Google Scholar 

• Schaible, S. (1996), Fractional programming with sums of ratios, Working Paper Series No. 96-04, Graduate School of Management, University of California, Riverside, CA.

  Google Scholar 

Download references