\input zb-basic
\input zb-ioport
\iteman{io-port 06090557}
\itemau{Du, Tingsong; Yang, Jingli; Shen, Yanjun; Fei, Pusheng}
\itemti{A modified explicit algorithm based-relaxation-strategy for solving semi-infinite programming.}
\itemso{Math. Pract. Theory 41, No. 9, 154-161 (2011).}
\itemab
Summary: In this paper, we investigate a class of linear semi-infinite programming. We adopt the relaxation-approach such that a sequence of linear programs $LP (T_k)$ and $DLP (T_k)$ is solved. Based on the relaxed strategies, and under some conditions, a new explicit algorithm is developed. The major improvement of the proposed new algorithm is that it allows the unnecessary constraints to be dropped at each iteration. In this way, the proposed algorithm avoid solving too large problems. Finally, three different algorithms (namely, the proposed explicit algorithm, the traditional cutting plane method, and the modification algorithm published literature) are implemented for same problems.
\itemrv{~}
\itemcc{}
\itemut{semi-infinite programming; explicit algorithm; relaxation-strategy}
\itemli{}
\end