Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have