论文信息 - Analytic Center Based Cutting Plane Method for Linear Semi-Infinite Programming - 字舞流文

Analytic Center Based Cutting Plane Method for Linear Semi-Infinite Programming

In this paper, an analytic center based cutting plane method is proposed for solving linear semi-infinite programming problems. It is shown that a near optimal solution can be obtained by generating a polynomial number of cuts.

Chih-Jen Lin | Shu-Cherng Fang | Soon-Yi Wu | Chih-Jen Lin | S. Fang | Soon-Yi Wu

[1] Klaus Roleff,et al. A stable multiple exchange algorithm for linear sip , 1979 .

[2] E. Anderson. Linear Programming In Infinite Dimensional Spaces , 1970 .

[3] Kenneth O. Kortanek,et al. Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..

[4] Chih-Jen Lin,et al. An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming , 1998, SIAM J. Optim..

[5] Kenneth O. Kortanek,et al. Numerical treatment of a class of semi‐infinite programming problems , 1973 .

[6] Klaus Glashoff,et al. Linear Optimization and Approximation , 1983 .

[7] Soon-Yi Wu,et al. On Linear Semi-Infinite Programming Problems: An Algorithm , 1992 .

[8] Chih-Jen Lin,et al. Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems , 1998 .

[9] S. Fang,et al. An inexact approach to solving linear semi-infinite programming problems , 1994 .

[10] Y. Ye,et al. On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems , 1994 .

[11] Yinyu Ye,et al. Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems , 1996, SIAM J. Optim..