A Subgradient Projection Method in Linear Programming
暂无分享,去创建一个
In the paper a method is presented which evaluates a solution of a linear programming problem. From the parameters of primal and dual program a symmetric matrix game is constructed. The search for the solution of this game is reduced to a problem of the constrained convex minimization, where the minimized function is the maximum of finite number of affine functions and a standard simplex is the feasible region and the minimal value of the function is known. The subgradient method of Polyak is applied to solve this problem. The algorithm converges geometrically. On each iteration the projection onto a standard simplex is applied, for which a combinatorial algorithm is presented.
[1] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.
[2] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .
[3] Boris Polyak. Minimization of unsmooth functionals , 1969 .
[4] Samuel Karlin,et al. Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .