| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4634019 | Applied Mathematics and Computation | 2008 | 4 Pages |
Abstract
In this technical note, we give a short extension application for a deterministic global optimization algorithm proposed in [Y. Ji, K.-C. Zhang, S.-J. Qu, A deterministic global optimization algorithm, Applied Mathematics and Computation 185 (2007) 382–387]. Actually our result is slightly more general, since it does not impose any special sign restrictions on numerators and denominators of the ratios. The only assumption is that the denominators of the ratios are nonzero over the feasible region of the problem. For clarity we use the same notations for the different equivalent problems and the corresponding relaxation linear programming (RLP) as done in Ji et al. (2007).
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Hongwei Jiao, Yongqiang Chen,