论文信息 - A Lagrange Multiplier Method for Certain Constrained Min-Max Problems

A Lagrange Multiplier Method for Certain Constrained Min-Max Problems

Constrained min-max problems are constant-sum, two-person games in which the maximizing player enjoys the advantage of moving last and both players select allocations subject to separate constraints on their use of resources. This paper presents a Lagrange multiplier method for addressing such problems where the maximizing player is permitted to mix strategies probabilistically. We derive conditions under which the method will locate optimal solutions and discuss suitable applications. A simple ABM/shelter deployment problem is solved to illustrate the essential features of the method.

Edward S. Pearsall | E. Pearsall

[1] Samuel Karlin,et al. Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[2] Guillermo Owen. Minimization of Fatalities in a Nuclear Attack Model , 1969, Oper. Res..

[3] George E. Pugh,et al. Lagrange Multipliers and the Optimal Allocation of Defense Resources , 1964 .

[4] Samuel Karlin,et al. Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[5] J. Bram. The Lagrange Multiplier Theorem for Max-Min with Several Constraints , 1966 .

[6] K. Arrow,et al. QUASI-CONCAVE PROGRAMMING , 1961 .

[7] R. Rockafellar. Duality theorems for convex functions , 1964 .

[8] D. Luenberger. Optimization by Vector Space Methods , 1968 .

[9] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[10] Richard M. Soland,et al. Optimal Defensive Missile Allocation: A Discrete Min-Max Problem , 1973, Oper. Res..

[11] J. Danskin. The Theory of Max-Min and its Application to Weapons Allocation Problems , 1967 .

[12] M. Sion. On general minimax theorems , 1958 .

[13] Edward S. Pearsall,et al. A Study of Active and Passive Systems for the Defense of Urban Population Centers. Volume II. The Model , 1971 .