Problèmes fractionnaires : Tour d'horizon sur les applications et méthodes de résolution

RAIRO Recherche Operationnelle

Volumn 33, Issue 4, 1999, Pages 383-419

  Nagih, Anass ^a   Plateau, Gérard ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

Applications; Fractional programming; Integer programming; Modelisation

Indexed keywords

EID: 0001224265     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro:1999118     Document Type: Article

References (75)

1. J. ABRHAM et S. LUTHRA, Comparison of duality models in fractional linear programming, Zeitschrift Oper. Res., 1977, 21, p. 125-130.
2. S. C. AGRAWAL et M. CHAND, A note on integer solutions to linear fractional interval programming problems by Branch and Bound technique, Naval Res. Logist. Quart., 1981, 28, no4, p. 671-677.
3. Y. ANZAI, On integer fractional programming, J. Oper. Res. Soc. Japan, 1974, 17, no1, p. 49-69.
4. H. ARSHAM et A. B. KHAN, A complete algorithm for linear fractional programs, Comput. Math. Appl., 1990, 20, no7, p. 11-23.
5. E. BALAS, An additive algorithm for solving linear programs with zero-one variables, Oper. Res., 1965, 13, no4, p. 517-546.
6. C. R. BECTOR, Duality in nonlinear fractional programming, Zeitschrift Oper. Res., 1973, 17, p. 183-193.
7. B. BEREANU, Decision regions and minimum risk solutions in linear programming, in: A. Prekopa, Ed., Colloquium on applications of mathematics to economics, Budapest, 1963, Publ. house of the Hungarian academy of sciences, Budapest, 1965, p. 37-42.
8. G. R. BITRAN et T. L. MAGNANTI, Duality and sensitivity analysis for fractional programs, Oper. Res., 1976, 24, no4, p. 675-699.
9. M. BLUM, R. W. FLOYD, V. PRATT, R. L. RIVEST et R. E. TARJAN, Time bounds for selection, J. Comput. Syst. Sci., 1973, 7, p. 448-461.
10. P. BOUCHER, A. NAGIH et G. PLATEAU, Méthodes heuristiques pour le problème hyperbolique en variables 0-1, Optimizations Days, Montréal, Canada, mai 1996.
11. S. CHANDRA et M. CHANDRAMOHAN, A Branch and Bound Method for Integer Nonlinear Fractional Programs, ZAMM, 1980, 60, p. 735-737.
12. S. CHANDRA et M. CHANDRAMOHAN, A note on integer linear fractional programming, Naval Res. Logist. Quart., 1980, 27, p. 171-174.
13. A. CHARNES et W. W. COOPER, Programming with linear fractional functionals, Naval Res. Logist. Quart., 1962, 9, p. 181-186.
14. B. D. CRAVEN, Fractional Programming, Helderman, Berlin, 1988.
15. C. DERMAN, On sequential decisions and Markov chains, Management Sci., 1962, 9, p. 16-24.
16. W. DINKELBACH, On nonlinear fractional programming, Management Sci., 1967, 13, p. 492-498.
17. M. FLORIAN et P. ROBILLARD, Programmation hyperbolique en variables bivalentes, Revue Francaise d'Informatique et de Recherche Opérationnelle, 1971, 5, no1, p. 3-9.
18. A. M. GEOFFRION, An improved implicit enumeration approach for integer programming, Oper. Res., 1969, 17, p. 437-454.
19. A. M. GEOFFRION, The Lagrangean Relaxation for Integer Programming, Math. Programming, 1974, 2, p. 82-114.
20. F. GLOVER, Surrogate constraints, Oper. Res., 1968, 16, no4, p. 741-749.
21. L. S. GOLD'STEIN, Dual problems of convex and fractionally-convex programming in functional spaces, Soviet Math. Dokl., 1967, 8, p. 212-216.
22. D. GRANOT et F. GRANOT, On solving fractional (0, 1) programs by implicit enumeration, INFOR, 1976, 14, p. 241-249.
23. D. GRANOT et F. GRANOT, On integer and mixed integer fractional programming problems, Ann. Discrete Math., 1977, 1, p. 221-231.
24. M. GRUSPAN, Fractional programming: A survey, Technical Report 50, Department of Industrial and Systems Engineering, University of Florida, 1971.
25. M. GRUNSPAN et M. E. THOMAS, Hyperbolic integer programming, Naval Res. Logist. Quart., 1973, 20, no2, p. 341-356.
26. M. GUIGNARD et S. KIM, Lagrangean decomposition for integer programming: A model yielding stronger Lagrangean bounds, Math. Programming, 1987, 32, p. 215-228.
27. E. GUTENBURG, Einfuhrung in die Betriebswirtschaftlehre, Gabler Wiesbaden, 1975.
28. P. L. HAMMER et S. RUDEANU, Boolean methods in operations research and related areas, Springer, Berlin - New York, 1968.
29. P. HANSEN, M. MINOUX et M. LABBÉ, Extension de la programmation linéaire généralisée au cas des programmes mixtes, C. R. Acad. Sci. Paris Sér. I Math., 1987, 305, p. 569-572.
30. P. HANSEN, M. V. POGGI DE ARAGAO et C. C. RIBEIRO, Hyperbolic 0-1 programming and query information retrieval. Math. Programming, 1991, 52, p. 255-263.
31. S. HASHIZUME, M. FUKUSHIMA, N. KATOH et T. IBARAKI, Approximation Algorithms for combinatorial fractional programming problem, Math. Programming, 1991, 37, p. 255-267.
32. M. H. HEINE, Distance between sets as an objective measure of retrieval effectiveness, Information Storage and Retrieval, 1973, 9, p. 181-198.
33. E. HEINEN, Grundlagen betriebswirtschaftlicher Entscheidungen, Das Zielsystem der Unternehmung Gabler Wiesbaden, 1971.
34. T. IBARAKI, Parametric approaches to fractional programs, Math. Programming, 1983, 26, p. 345-362.
35. O. H. IBARRA et C. E. KIM, Fast approximation algorithms for the knapsack and sum of subsets problems, J. Assoc. Comput. Machinery, 1975, 22, no4, p. 463-468.
36. J. R. ISBELL, et W. H. MARLOW, Attribution games, Naval Res. Logist. Quart., 1956, 3, p. 71-94.
37. H. ISHII, T. IBARAKI et H. MINE, A primal cutting plane algorithm for integer fractional programming problems, J. Oper. Res. Soc. Japan. 1976, 19, p. 228-244.
38. H. ISHII, T. IBARAKI et H. MINE, Fractional Knapsack problems, Math. Programming, 1977, 13, p. 255-271.
39. J. G. KALLBERG et W. T. ZIEMBA, Generalized Concave Functions in Stochastic Programming and Portfolio Theory, in: S. Schaible and W. T. Ziemba, eds., Generalized Concavity in Optimization and Economics, Academic Press, New York 1981, p. 719-767.
40. M. KLEIN, Inspection-maintenance-replacement schedule under Markovian deterioration, Management Sci., 1963, 9, p. 25-32.
41. L. S. LASDON, Optimization Theory for Large Systems, Collier-MacMillan, 1970.
42. S. MARTELLO et P. TOTH, Knapsack Problems, J. Wiley & Sons, 1990.
43. B. MARTOS, Hyperbolic programming, Naval Res. Logist. Quart., 1964, 11, p. 135-155.
44. B. MARTOS, The Direct Power of Adjacent Vertex Programming Methods, Management Sci., 1965, 12, no3, p. 241-252.
45. B. MARTOS, Nonlinear programming: Theory and methods, North-Holland, Amsterdam, 1975.
46. N. MEGGIDO, Combinatorial optimization with rational objective functions, Math. Oper. Res., 1979, 4, no4, p. 414-424.
47. P. MICHELON et N. MACULAN, An algorithm for the mixed or integer fractional programming, Research Report ES-161-88, University of Rio de Janeiro, 1988.
48. P. MICHELON et N. MACULAN, Lagrangean methods for 0-1 quadratic problems, Discrete Applied Mathematics, 1993, 42, p. 257-269.
49. K. M. MJELDE, Allocation of resources according to a fractional objective, European J. Oper. Res., 1978, 2, p. 116-124.
50. K. M. MJELDE, Methods of the Allocation of Limited ressources, J. Wiley and Sons, Chichester, 1983.
51. A. NAGIH, Sur la résolution des programmes fractionnaires en variables 0-1, Thèse de Doctorat, Université Paris 13, France, juin 1996.
52. A. NAGIH et G. PLATEAU, A Lagrangian Decomposition for 0-1 Hyperbolic Programming Problems, Int. J. Math. Algorithms, to appear.
53. A. NAGIH et G. PLATEAU, Méthodes lagrangiennes pour les problèmes hyperboliques en variables 0-1, FRANCORO : Rencontres Francophones de Recherche Opérationnelle, Mons, Belgique, juin 1995.
54. er novembre 1995.
55. A. NAGIH et G. PLATEAU, Sur la résolution des programmes fractionnaires en variables 0-1, CIRO : Conférence Internationale en Recherche Opérationnelle, Marrakech, Maroc, juin 1996.
56. A. NAGIH et G. PLATEAU, Dualité lagrangiennne en programmation fractionnaire concave-convexe en variables entières, Rapport de Recherche, LIPN 96, Université Paris 13, 1996.
57. A. NAGIH et G. PLATEAU, A Partition Algorithm for 0-1 unconstrained hyperbolic programs, Investigación Oper., 1999, 8, no 1.
58. C. H. PAPADIMITRIOU et K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
59. J. PONSTEIN, Seven Kinds of convexity. SIAM Review, 1967, 9, no 1.
60. T. RADZIK, Newton's method for fractional combinatorial optimization, Report STAN-CS-92-1406, Stanford university, California, 1992.
61. P. ROBILLARD, 0-1 hyperbolic programming, Naval Res. Logist. Quart., 1971, 18, p. 47-58.
62. A. L. SAIPE, Solving a (0, 1) hyperbolic program by branch and bound, Naval Res. Logist. Quart., 1975, 22, p. 397-416.
63. S. SCHAIBLE, Duality in fractional programming: a unified approach, Oper. Res., 1976, 24, no3, p. 452-461.
64. S. SCHAIBLE, Fractional programming: Applications and algorithms, European J. Oper. Res., 1981, 17, p. 111-120.
65. S. SCHAIBLE et T. IBARAKI, Fractional programming, European J. Oper. Res., 1983, 12, p. 325-338.
66. I. C. SHARMA et K. SWARUP, On duality in linear fractional functional programming, Zeitschrift für Operations Research, 1972, 16, p. 91-100.
67. I. M. STANCU-MINASIAN, Applications of the fractional programming, Econom. Comput. Econom. Cybernet. Stud. Res., 1980, 14, p. 69-86.
68. C. J. VAN RIJSBERGEN, Function of evaluation, The Journal of Documentation, 1974, 30, no4, p. 365-373.
69. V. VERMA, Constrainted Integer Linear Fractional Programming Problem, Optimization, 1990, 21, no5, p. 749-757.
70. V. VERMA, H. C. BAKHSHI et M. C. PURI, Ranking in integer linear fractional programming problems, Methods and Models of Operations Research, 1990, 34, p. 325-334.
71. H. M. WAGNER et J. S. C. Y JAN, Algorithmic equivalence in linear fractional programming, Management Sci., 1968, 14, p. 301-306.
72. T. WEIR et B. MOND, Duality for Frational Programming without Constraint Qualification, Utilitas Mathe., 1990, 38, p. 193-197.
73. H. P. WILLIAMS, Experiments in the formulation of integer programming problems, Math. Programming Studi, 1974, 2, p. 180-197.
74. H. WOLF, Parametric Analysis in linear fractional programming, Oper. Res., 1986, 34, no6, p. 930-937.
75. W. T. ZIEMBA, C. PARKAN et R. BROOKS-HILL, Calculation of investment portfolios with risk free borrowing and lending, Management Sci., 1974, 21, p. 209-222.