Abstract
A certain constrained ratio game is shown to be equivalent to a pair of mutually dual generalized fractional programming problems. This also extends the concept of symmetric duality to min-max fractional programming.
Zusammenfassung
Es wird gezeigt, daß ein ratio game mit Beschränkungen einem Paar dualer verallgemeinerter Quotientenprogramme äquivalent ist. Diese erweisen sich als symmetrisch.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chandra S, Craven BD, Mond B (1986) Generalized fractional programming duality: a ratio game game approach. J of Austral Math Soc (Ser B) 28:170–180
Charnes A (1953) Constrained games and linear programming. Proc Nat Acad Sci 39:639–641
Crouzeix JP, Ferland JA, Schaible S (1983) Duality in generalized fractional programming. Mathematical Programming 27:342–354
Jagannathan R, Schaible S (1983) Duality in generalized fractional programming via Farkas lemma. J Optimization Theory and Applications 41:417–424
Karlin S (1959) Mathematical methods and theory in games. Programming and Mathematical Economics. Addison-Wesley, Reading, Mass.
Kawaguchi T, Maruyama Y (1976) A note on minimax (maximin) programming. Management Science 22:670–676
Owen G (1982) Game theory, second ed. Academic Press, New York
Schroeder RG (1970) Linear programming solutions to ratio games. Operations Research 18:300–305
Author information
Authors and Affiliations
Additional information
Research by this author was carried out while he was visiting I.I.T. Delhi, India, under an Australian Vice-Chancellors' Committee Visiting Fellowship.
Rights and permissions
About this article
Cite this article
Chandra, S., Mond, B. & Durga Prasad, M.V. Constrained ratio games and generalized fractional programming. Zeitschrift für Operations Research 32, 307–314 (1988). https://doi.org/10.1007/BF01920300
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01920300