About this document

Central-Cutting-Plane Algorithm for Semi-Infinite Programming by Benit Wa-meni is a document available to read on EtoBox.

This document presents a central-cutting-plane algorithm for solving semi-infinite programming problems, which improves upon existing methods by allowing cuts to be generated from any violated constraint without affecting convergence. The algorithm ensures that convergence is maintained even when the most violated constraint is not identified, making it more efficient. The paper also discusses the convergence properties of the algorithm and provides a detailed outline of its steps and theoretical foundation

Author

Benit Wa-meni

Language

EN