摘要
This paper presents a new method, called the maximum entropy method,for solving semi-infinite programming problems, in which the semi-infinite programmingproblem is approximated by one with a single constraint. The convergence properties forthis method are discussed. Numerical examples are given to show the high effciency of thealgorithm.
This paper presents a new method, called the maximum entropy method,for solving semi-infinite programming problems, in which the semi-infinite programmingproblem is approximated by one with a single constraint. The convergence properties forthis method are discussed. Numerical examples are given to show the high effciency of thealgorithm.
