Linear max-min programming
Tóm tắt
Theoretical aspects of the programming problem of maximizing the minimum value of a set of linear functionals subject to linear constraints are explored. Solution strategies are discussed and an optimality condition is developed. An algorithm is also presented.
Tài liệu tham khảo
R.G. Bland, “New finite pivoting rules for the simplex method”,Mathematics of Operations Research 2 (1977) 103–107.
V.F. Demýanov and V.N. Malozemov,Introduction to minimax (Halsted, New York, 1974).
J.Ch. Fiorot, “Generation of all integer points for given sets of linear inequalities”,Mathematical Programming 3 (1972) 276–295.
R. Gupta and S.R. Arora, “Programming problem with maximin objective function”,Opsearch 14 (1977) 125–130.
S. Kaplan, “Applications of programs with maximin objective functions to problems of optimal resource allocation”,Operations Research 22 (1974) 802–807.
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970).
P. Wolfe, “Methods of nonlinear programming”, in: J. Abadie, ed.,Nonlinear programming (North-Holland, Amsterdam, 1967) 121–123.
C. Wu and M.E. Posner, “A note on programming problem with maximin objective function”,Opsearch 15 (1978) 117–119.
W.I. Zangwill, “The convex simplex method”,Management Science 14 (1967) 221–238.