SIPAMPL: Semi-infinite programming with AMPL
ACM Transactions on Mathematical Software (TOMS)
Environmental Modelling & Software
Penalty and Smoothing Methods for Convex Semi-Infinite Programming
Mathematics of Operations Research
Hi-index | 0.00 |
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed. Both primal and dual convergence results are established under some basic assumptions. Numerical examples are also included to illustrate this approach.