Semi-infinite Programming

Upper bounds for finding an [epsilon]-optimal solution and for the distance between an [epsilon]-optimal solution and an optimal solution are given. (4) Applications of the above algorithm to convex programming. First, a certain semi-infinite linear program is solved by this algorithm so as to obtain a feasible solution of a convex program. Then, another semi-infinite linear program is solved by this algorithm so as to obtain an optimal solution of the convex program. In particular, it is shown that for a strongly consistent convex program this algorithm can find a feasible solution after a finite number of iterations."