A globally convergent method for semi-in
✍
H. Hu
📂
Article
📅
1996
🏛
Springer US
🌐
English
⚖ 541 KB
This paper presents a globally convergent method for solving a general semi-infinite linear programming problem. Some important features of this method include: It can solve a semi-infinite linear program having an unbounded feasible region. It requires an inexact solution to a nonlinear subproblem