A new algorithm for generalized fractional programs

Mathematical Programming, Series B

Volumn 72, Issue 2, 1996, Pages 147-175

  Barros, A I ^a   Frenk, J B G ^b   Schaible, S ^c   Zhang, S ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dinkelbach type algorithms; Duality; Fractional programming; Generalized fractional programming; Karush Kuhn Tucker conditions; Quasi convexity

Indexed keywords

EID: 0001204054     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592087     Document Type: Article

References (32)

1. M. Avriel, W.E. Diewert, S. Schaible and I. Zang, Generalized Concavity, Mathematical Concepts and Methods in Science and Engineering, Vol. 36 (Plenum, New York, 1988).
2. A.I. Barros, Discrete and Fractional Programming Techniques for Location Models, Tinbergen Institute Research Series, Vol. 89 (Thesis Publishers, Amsterdam, 1995).
3. A.I. Barros and J.B.G. Frenk, "Generalized fractional programming and cutting plane algorithms," Journal of Optimization Theory and Applications 87 (1995) 103-120.
4. M.S. Bazaraa, H.D. Sherali and C.M. Shetty, Nonlinear Programming: Theory and Algorithms (Wiley, New York, 2nd ed., 1993).
5. Y. Benadada, "Approches de résolution du problème de programmation fractionnaire généralisée," Ph.D. Thesis (Department d'Informatique et de Recherche Opérationelle, Université de Montréal, 1989).
6. A. Ben-Israel, A. Ben-Tal and S. Zlobec, Optimality in Nonlinear Programming (A Feasible Directions Approach) (Wiley, New York, 1981).
7. J.C. Bernard and J.A. Ferland, "Convergence of interval-type algorithms for generalized fractional programming," Mathematical Programming 43 (1989) 349-364.
8. B.D. Craven, Fractional Programming (Heldermann, Berlin, 1988).
9. J.P. Crouzeix and J.A. Ferland, "Algorithms for generalized fractional programming," Mathematical Programming 52 (1991) 191-207.
10. J.P. Crouzeix, J.A. Ferland and S. Schaible, "Duality in generalized linear fractional programming," Mathematical Programming 27 (1983) 342-354.
11. J.P. Crouzeix, J.A. Ferland and S. Schaible, "An algorithm for generalized fractional programs," Journal of Optimization Theory and Applications 47 (1985) 35-49.
12. J.P. Crouzeix, J.A. Ferland and S. Schaible, "A note on an algorithm for generalized fractional programs," Journal of Optimization Theory and Applications 50 (1986) 183-187.
13. W. Dinkelbach, "On nonlinear fractional programming," Management Science 13 (1967) 492-498.
14. J.A. Ferland and J.Y. Potvin, "Generalized fractional programming: Algorithms and numerical experimentation," European Journal of Operational Research 20 (1985) 92-101.
15. J. Flachs, "Generalized Cheney-Loeb-Dinkelbach-type algorithms," Mathematics of Operations Research 10 (1985) 674-687.
16. J.B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms I: Fundamentals, Vol. 1 (Springer, Berlin, 1993).
17. T. Ibaraki, "Parametric approaches to fractional programs," Mathematical Programming 26 (1983) 345-362.
18. T. Ibaraki, H. Ishii, J. Iwase, T. Hasegawa and H. Mine, "Algorithms for quadratic fractional programming problems," Journal of the Operations Research Society of Japan 19 (1976) 174-191.
19. R. Jagannathan and S. Schaible, "Duality in generalized fractional programming via Parkas' lemma," Journal of Optimization Theory and Application 41 (1983) 417-424.
20. J. Outrata, H. Schramm and J. Zowe, "Bundle trust methods: Fortran codes for nondifferentiable optimization, User's guide," Technical Report 269 (Mathematisches Institut, Universität Bayreuth, 1991).
21. E. Polak, "On the mathematical foundations of nondifferentiable optimization in engineering design," SIAM Review 29 (1987) 21-89.
22. B.N. Pschenichnyi, Necessary Conditions for an Extremum (Marcel Dekker, New York, 1971).
23. A. Ravindran, "A computer routine for quadratic and linear programming problems," Communications of the ACM 15 (1972) 818.
24. A.W. Roberts and D.E. Varberg, Convex Functions (Academic Press, New York, 1973).
25. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
26. R.T. Rockafellar, "Generalized subgradients in mathematical programming," in: A. Bachem, M. Grötschel and B. Korte, eds., Mathematical Programming. The State of the Art (Springer, Berlin, 1983) ch. 2, pp. 368-390.
27. S. Schaible, "Fractional programming," Zeitschrift für Operations Research 27 (1983) 39-54.
28. S. Schaible and T. Ibaraki, "Fractional programming," (Invited Review), European Journal of Operational Research 12 (1983) 325-338.
29. N.Z. Shor, Minimization Methods for Non-differentiable Functions, Computational Mathematics, Vol. 3 (Springer, Berlin, 1985).
30. M. Sion, "On general minimax theorems," Pacific Journal of Mathematics 8 (1958) 171-176.
31. J. Werner, "Duality in generalized fractional programming," in: K.H. Hoffman, J.B. Hiriart-Urruty, C. Lemaréchal and J. Zowe, eds., Trends in Mathematical Optimization, International Series of Numerical Mathematics (Birkhäuser, Basel, 1988) pp. 197-232.
32. Z. Zhou, F.S. Mokhtarian and S. Zlobec, "A simple constraint qualification in convex programming," Mathematical Programming 61 (1993) 385-397.