Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-04-30T12:15:18.037Z Has data issue: false hasContentIssue false
  • English
  • Français

A duality theorem for a nondifferentiable nonlinear fractional programming problem

Published online by Cambridge University Press:  17 April 2009

B. Mond  and
B.D. Craven
B. Mond
Affiliation:
Department of Pure Mathematics, La Trobe University, Bundoora, Victoria;
B.D. Craven
Affiliation:
Department of Mathematics, University of Melbourne, Parkville, victoria.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A duality theorem, and a converse duality theorem, are proved for a nonlinear fractional program, where the numerator of the objective function involves a concave function, not necessarily differentiable, and also the support function of a convex set, and the denominator involves a convex function, and the support function of a convex set. Various known results are deduced as special cases.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 20 , Issue 3 , June 1979 , pp. 397 - 406
Copyright
Copyright © Australian Mathematical Society 1979

References

[1]Aggarwal, S.P., Saxena, P.C., “Duality theorems for non-linear fractional programs”, Z. Angew. Math. Mech. 55 (1975), 523–525.CrossRefGoogle Scholar
[2]Aggarwal, S.P. & Saxena, P.C., “A class of fractional functional programming problems”, New Zealand Oper. Res. 7 (1979), 79–90.Google Scholar
[3]Chandra, Suresh and Gulati, T.R., “A duality theorem for a non- differentiable fractional programming problem”, Management Sci. 23 (1976/1977), 32–37.Google Scholar
[4]Craven, B.D., “Lagrangean conditions and quasiduality”, Bull. Austral. Math. Soc. 16 (1977), 325–339.Google Scholar
[5]Craven, B.D., Mathematical programming and control theory (Chapman and Hall, London; John Wiley & Sons, New York; 1978).CrossRefGoogle Scholar
[6]Craven, B.D. and Mond, B., “Transposition theorems for cone-convex functions”, SIAM J. Appl. Math. 24 (1973), 603–612.CrossRefGoogle Scholar
[7]Craven, B.D. and Mond, B., “The dual of a fractional linear program”, J. Math. Anal. Appl. 42 (1973), 507–512.Google Scholar
[8]Craven, B.D. and Mond, B., “The dual of a fractional linear program: Erratum”, J. Math. Anal. Appl. 55 (1976), 807.Google Scholar
[9]Craven, B.D. and Mond, B., “Lagrangean conditions for quasi-differentiable optimization”, Survey of mathematical programming I (Proc. Ninth Intern. Sympos. Mathematical Programming, Budapest, 1976. North-Holland, to appear).Google Scholar
[10]Mond, Bertram, “A class of nondifferentiable mathematical programming problems”, J. Math. Anal. Appl. 46 (1974), 169–174.CrossRefGoogle Scholar
[11]Mond, B., “A class of nondifferentiable fractional programming problems”, Z. Angew. Math. Mech. 58 (1978), 337–341.Google Scholar
[12]Mond, Bertram and Schechter, Murray, “A programming problem with an Lp norm in the objective function”, J. Austral. Math. Soc. Ser. B 19 (1975/1976), 333–342.Google Scholar
[13]Mond, B. and Schechter, M., “A duality theorem for a homogeneous fractional programming problem”, J. Optim. Theory Appl. 25 (1978), 349–359.CrossRefGoogle Scholar
[14]Mond, B. and Schechter, M., “Converse duality in homogeneous fractional programming”, preprint, 1979.Google Scholar
[15]Rockafellar, R. Tyrrell, Convex analysis (Princeton University Press, Princeton, New Jersey, 1970).Google Scholar