Skip to main content
Log in

A min max problem

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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.

    Google Scholar 

  • Hadley, G.: Linear Programming. Reading 1962.

  • Hammer, P.L.: Time minimization transportation problem. Nav. Res. Log. Quart.16, 1969, 345–357.

    Google Scholar 

  • Kaplan, S.: Applications of programs with maximin objective functions to problems of optimal resource allocation. Operations Research22 (4) 1974, 802–807.

    Google Scholar 

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01919246

Keywords

Navigation