Advertisement

Fractional and complex programming

Chapter
  • 108 Downloads
Part of the Chapman and Hall Mathematics Series book series (CHMS)

Abstract

A number of applications lead to constrained minimization problems, in which the objective function, to be minimized or maximized, is a quotient, f(x)/g(x), of two functions. Such a problem is called a fractional programming problem. In particular, it is a linear fractional programming problem if f and g are linear, or affine, functions, and the constraints are linear. Although such problems are particular cases of nonlinear programming problems, stronger results for fractional programming problems are obtainable by proceeding directly, rather than applying the theory of Chapter 4. This applies both to theoretical questions, notably duality theory, and to effective algorithms for computing an optimum.

Keywords

Mathematical Program Complex Space Convex Cone Fractional Programming Complex Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bereanu, B. (1963), Distribution problems and minimum risk solutions in stochastic programming, in Colloquium on Applications of Mathematics to Economics, Prékopa, A. (Ed.), Akadémiai Kiadó, Budapest, 37–42.Google Scholar
  2. Bitran, G.R., and Novaes, A.G. (1973), Linear programming with a fractional objective function, Operations Research, 21, 22–29.CrossRefGoogle Scholar
  3. Charnes, A., and Cooper, W.W. (1962), Programming with linear fractional functional, Naval Res. Log. Quart., 9, 181–186.CrossRefGoogle Scholar
  4. Craven, B.D., and Mond, B. (1972), Converse and symmetric duality in complex nonlinear programming, J. Math. Anal. Appl., 37, 617–626.CrossRefGoogle Scholar
  5. Craven, B.D., and Mond, B. (1973), Real and complex Fritz John theorems, J. Math. Anal. Appl., 44, 773–778.CrossRefGoogle Scholar
  6. Craven, B.D., and Mond, B. (1973), A Fritz John theorem in complex space, Bull. Austral. Math. Soc., 8, 215–220.CrossRefGoogle Scholar
  7. Craven, B.D., and Mond, B. (1973, 1976), The dual of a fractional linear program, J. Math. Anal. Appl., 42, 507–512, and 55, 807.CrossRefGoogle Scholar
  8. Craven, B.D., and Mond, B. (1975), On fractional programming and equivalence, Naval Res. Log. Quart., 22, 405–410.CrossRefGoogle Scholar
  9. Craven, B.D., and Mond, B. (1976), Duality for homogeneous fractional programming, Cahiers du Centre d’ Ëtudes de Recherche Opérationelle, 18, 413–417.Google Scholar
  10. Derman, C. (1962), On sequential decisions and Markov chains, Management Sci., 9, 16–24.CrossRefGoogle Scholar
  11. Dinkelbach, W. (1967), On nonlinear fractional programming, Management Sci., 13, 492–498.CrossRefGoogle Scholar
  12. Dorn, W.S. (1962), Linear fractional programming, IBM Research Report RC-830.Google Scholar
  13. Fox, B. (1966), Markov renewal programming by linear fractional programming, SIAM J. Appl. Math., 14, 1418–1432.CrossRefGoogle Scholar
  14. Frank, M., and Wolfe, P. (1956), An algorithm for quadratic programming, Naval Res. Log. Quart., 3, 95–110.CrossRefGoogle Scholar
  15. Gilmore, P.C., and Gomory, R.E. (1961, 1963), A linear programming approach to the cutting stock problem, Operations Research, 9, 849–859; 11, 863-888.CrossRefGoogle Scholar
  16. Isbell, J.R., and Marlow, W.H. (1956), Attrition games, Naval Res. Log. Quart., 3, 71–94.CrossRefGoogle Scholar
  17. Klein, M. (1963), Inspection—maintenance-replacement schedule under Markovian deterioration, Management Sci., 9, 25–32.CrossRefGoogle Scholar
  18. Lintner, J. (1965), The valuation of risk assets and the selection of risky investment in stock portfolios and capital budgets, Rev. of Econ. and Stat., 47, 13–37.CrossRefGoogle Scholar
  19. Mangasarian, O.L. (1969), Nonlinear fractional programming, J. Opns. Res. Soc. Japan, 12, 1–10.Google Scholar
  20. Mangasarian, O.L. (1969), Nonlinear programming, McGraw-Hill, New York.Google Scholar
  21. Meister, B., and Oettli, W. (1967), On the capacity of a discrete, constant channel, Inf. and Control, 11, 341–351.CrossRefGoogle Scholar
  22. Mond, B., and Craven, B.D. (1973), A note on mathematical programming with fractional objective functions, Naval Res. Log. Quart., 20, 577–581.CrossRefGoogle Scholar
  23. Mond, B., and Craven, B.D. (1975), A class of nondifferentiable complex programming problems, Math. Operationaforschung und Statistik, 6, 577–581.Google Scholar
  24. Mond, B., and Craven, B.D. (1975), Nonlinear fractional programming, Bull. Austral. Math. Soc., 12, 391–397.CrossRefGoogle Scholar
  25. Pollack, E.G., Novaes, G.N., and Frankel, G. (1965), On the optimization and integration of shipping ventures, International Shipbuilding Progress, 12, 267–281.Google Scholar
  26. Schaible, S. (1976), Fractional programming. I, Duality. II, On Dinkelbach’s algorithm. Management Science, 22, 858–867, 868-873.CrossRefGoogle Scholar
  27. Schaible, S. (1976), Duality in fractional programming: a unified approach, Operations Research, 24, 452–461.CrossRefGoogle Scholar
  28. Sharma, I.C. (1967), Feasible direction approach to fractional programming problems, Opsearch, 4, 61–72.Google Scholar
  29. Sharma, I.C, and Swarup, K. (1972), On duality in linear fractional functionals programming, Zeitschrift für Operations Research, 16, 91–100.CrossRefGoogle Scholar
  30. Swarup, K. (1965), Programming with quadratic fractional functionals, Opsearch, 2, 23–30.Google Scholar
  31. Ziemba, W.T., Parkan, C., and Brooks-Hill, R. (1974), Calculation of investment portfolios with risk free borrowing and lending, Management Sci., 21, 209–222.CrossRefGoogle Scholar

Copyright information

© B. D. Craven 1978

Authors and Affiliations

  1. 1.University of MelbourneAustralia

Personalised recommendations