DISCRETE APPROXIMATION OF A PROBLEM OF CONTINUOUS PROGRAMMING

A discrete method of solving a continuous programming problem with convex cost functional and linear constraints with Fredholm operator in the space of essentially bounded functions is proposed. The original problem is replaced by a sequence of mathematical programming problems of increasing dimensions. Conditions which guarantee convergence of the optimum values and weak convergence of the optimal solutions are described.