Relaxed cutting plane method for solving linear semi-infinite programming problems

Relaxed cutting plane method for solving linear semi-infinite programming problems

0.00 Avg rating0 Votes
Article ID: iaor19993126
Country: United States
Volume: 99
Issue: 3
Start Page Number: 759
End Page Number: 779
Publication Date: Dec 1998
Journal: Journal of Optimization Theory and Methods
Authors:
Abstract:

One of the major computational tasks of using the traditional cutting plane approach to solve linear semi-infinite programming problems lies in finding a global optimizer of a nonlinear and nonconvex program. This paper generalizes the Gustafson and Kortanek scheme to relax this requirement. In each iteration, the proposed method chooses a point at which the infinite constraints are violated to a degree, rather than a point at which the violations are maximized. A convergence proof of the proposed scheme is provided. Some computational results are included. An explicit algorithm which allows the unnecessary constraints to be dropped in each iteration is also introduced to reduce the size of computed programs.

Reviews

Required fields are marked *. Your email address will not be published.