Outcome-Space Cutting-Plane Algorithm for Linear Multiplicative Programming |
| |
Authors: | Benson H P Boger G M |
| |
Institution: | (1) Warrington College of Business Administration, University of Florida, Gainesville, Florida |
| |
Abstract: | This article presents an outcome-space pure cutting-plane algorithm for globally solving the linear multiplicative programming problem. The framework of the algorithm is taken from a pure cutting-plane decision set-based method developed by Horst and Tuy for solving concave minimization problems. By adapting this method to an outcome-space reformulation of the linear multiplicative programming problem, rather than applying directly the method to the original decision-set formulation, it is expected that considerable computational savings can be obtained. Also, we show how additional computational benefits might be obtained by implementing the new algorithm appropriately. To illustrate the new algorithm, we apply it to the solution of a sample problem. |
| |
Keywords: | global optimization multiplicative programming cutting plane nonconvex programming outcome space extreme-point search |
本文献已被 SpringerLink 等数据库收录! |
|