The Lagrange multiplier method in the finite convex programming problem

In this paper we investigate the possibility of using the modified Lagrange's function for solving of a finite-dimensional convex programming problem. Convergence of the modified duality method is proved under the most general assumptions concerning of initial problem.