A min max problem
Tóm tắt
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.
Tài liệu tham khảo
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.