Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-05-31T18:47:04.364Z Has data issue: false hasContentIssue false
  • English
  • Français

Duality in fractional minimax programming

Published online by Cambridge University Press:  09 April 2009

S. Chandra  and
Viveka Kumar
S. Chandra
Affiliation:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India
Viveka Kumar
Affiliation:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India
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.

Certain omissions in the recently introduced dual for fractional minimax programming problem ‘minimize max y ∈ Y f(x, y) / h(x, y), subject to g(x) ≤ 0’, are indicated and two modified duals for this problem are presented. Various fractional programming and generalized fractional programming duals are shown to be special cases of this study.

MSC classification

Secondary: 90C32: Fractional programming
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 58 , Issue 3 , June 1995 , pp. 376 - 386
Copyright
Copyright © Australian Mathematical Society 1995

References

[1]Bector, C. R., ‘Duality in nonlinear fractional programming’, Z. Oper. Res. 17 (1973), 183–193.Google Scholar
[2]Bector, C. R., Chandra, S. and Bector, M. K., ‘Generalized fractional programming duality: A parametric approach’, J. Optim. Theory Appl. 60 (1988), 243–260.CrossRefGoogle Scholar
[3]Bector, C. R. and Suneja, S. K., ‘Duality in nondifferentiable generalized fractional programming’, Asia-Pacific J. Oper. Res. 5 (1988), 134–139.Google Scholar
[4]Chandra, S., Craven, B. D. and Mond, B., ‘Generalized fractional programming duality: A ratio game approach’, J. Austral. Math. Soc. (Series B) 28 (1986), 170–180.CrossRefGoogle Scholar
[5]Craven, B. D., Fractional programming (Heldermann, Berlin, 1988).Google Scholar
[6]Crouzeix, J. P., Ferland, J. A. and Scheible, S., ‘Duality in generalized fractional programming’, Math. Prog. 27 (1983), 342–354.CrossRefGoogle Scholar
[7]Danskin, J. M., ‘The theory of max-min with applications’, SIAM J. Appl. Math. 14 (1966), 641–664.CrossRefGoogle Scholar
[8]Demyanov, V. F. and Malozemov, V. N., Introduction to minimax (Wiley, New York, 1974).Google Scholar
[9]Gwinner, J. and Jeyakumar, V., ‘A solvability theorem and minimax fractional programming’, Applied Mathematics preprint AM91/7, University of New South Wales, 1991.Google Scholar
[10]Jagannathan, R. and Schiable, S., ‘Duality in generalized fractional programming via Farkas Lemma’, J. Optim. Theory Appl. 41 (1983), 417–424.CrossRefGoogle Scholar
[11]Mond, B. and Weir, T., ‘Generalized concavity and duality’, in: Generalized concavity in optimization and economics, (eds. Schiable, S. and Ziemba, W. T.) (Academic Press, New York, 1981).Google Scholar
[12]Schiable, S., ‘Fractional Programming I, Duality’, Management Sci. 22 (1976), 858–867.CrossRefGoogle Scholar
[13]Schiable, S. and Ibaraki, T., ‘Fractional Programming’, European J. Oper. Res. 12 (1983), 325–338.CrossRefGoogle Scholar
[14]Schmitendrof, W. E., ‘Necessary conditions and sufficient conditions for static minimax problems’, J. Math. Anal. Appl. 57 (1977), 683–693.CrossRefGoogle Scholar
[15]Tanimoto, S., ‘Duality for a class of nondifferentiable mathematical programming problems’, J. Math. Anal. Appl. 79 (1981), 283–294.CrossRefGoogle Scholar
[16]Yadav, S. R. and Mukherjee, R. N., ‘Duality for fractional minimax programming problems’, J. Austral. Math. Soc. (Series B) 31 (1990), 484–492.CrossRefGoogle Scholar