A NUMERICAL APPROACH TO INFINITE-DIMENSIONAL LINEAR PROGRAMMING IN L-1 SPACES

作者：Ito Satoshi^*; Wu Soon Yi; Shiu Ting Jang; Teo Kok Lay

来源：Journal of Industrial and Management Optimization, 2010, 6(1): 15-28.

DOI：10.3934/jimo.2010.6.15

• Infinite-dimensional linear programming
• semi-infinite programming
• cutting plane method
• numerical approach

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.

• 出版日期2010-2