Abstract
This paper studies a special class of min max problems in two sections. In Section I, a procedure is developed which gives the optimal solution of the problem. The Section II deals with ranking the solutions in increasing order of the value of the objective function.
Zusammenfassung
Eine spezielle Klasse von Minimax-Problemen wird untersucht. In Teil I wird ein Verfahren zur Bestimmung der Optimal-Lösung des Problems entwickelt. Teil II behandelt die Anordnung der Lösungen entsprechend ansteigender Werte der Zielfunktion.
Similar content being viewed by others
References
Garfinkel, R.S., andM.R. Rao: The bottleneck transportation problem. Nav. Res. Log. Quart.18, 1971, 465–472.
Hadley, G.: Linear Programming. Reading 1962.
Hammer, P.L.: Time minimization transportation problem. Nav. Res. Log. Quart.16, 1969, 345–357.
Kaplan, S.: Applications of programs with maximin objective functions to problems of optimal resource allocation. Operations Research22 (4) 1974, 802–807.
Mangasarian, O.: Non-linear programming. New York 1969.
Murty, K. G.: An algorithm for ranking all the assignements in order of increasing cost. Operations Research16, 1968, 682–687.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bansal, S., Puri, M.C. A min max problem. Zeitschrift für Operations Research 24, 191–200 (1980). https://doi.org/10.1007/BF01919246
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01919246