Finite algorithm for generalized linear multiplicative programming
Journal of Optimization Theory and Applications
A Finite Algorithm for a Class of Nonlinear Multiplicative Programs
Journal of Global Optimization
Global Optimization of Multiplicative Programs
Journal of Global Optimization
Hi-index | 7.29 |
The aim of this paper is to propose a solution algorithm for a particular class of rank-two nonconvex programs having a polyhedral feasible region. The algorithm is based on the so-called ''optimal level solutions'' method. Various global optimality conditions are discussed and implemented in order to improve the efficiency of the algorithm.