An infinite-dimensional linear programming formulated on L 1 spaces, problem (P), is studied in this paper. A related optimization problem, general capacity problem (GCAP), is also mentioned in this paper. But we find that the optimal solution does not exist in problem (P). Thus, we approach the optimal value for problem (P) via solving the problem (GCAP). A proposed algorithm is shown that we solve a sequence of semi-infinite subproblems to approach the optimal value of problem (P). The error bound for the difference between the optimal value for problem (P) and optimal value for semi-infinite subproblem is also given in this paper. Finally, numerical examples are implemented and compared with discretization method to show our computational efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.