A deterministic global optimization algorithm

Applied Mathematics and Computation

Volumn 185, Issue 1, 2007, Pages 382-387

  Ji, Ying ^a   Zhang, Ke Cun ^a   Qu, Shao Jian ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Branch and bound algorithm; General linear sum of ratios; Linearization relaxation

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; PROBLEM SOLVING;

BRANCH AND BOUND ALGORITHMS; GENERAL LINEAR SUM OF RATIOS; LINEARIZATION RELAXATION;

ALGORITHMS;

EID: 33846895658     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.06.101     Document Type: Article

References (6)

1. Konno H., and Watanabe H. Bond portfolio optimization problems and their application to index tracking: a partial optimization approach. Journal of the Operations Research Society of Japan 39 (1996) 295-306
2. Konno H., and Inori M. Bond portfolio optimization by bilinear fractional programming. Journal of the Operations Research Society of Japan 32 (1989) 143-158
3. Charnes A., and Cooper W.W. Programming with linear fractional functionk. Naval Research Logistick Quarterly 9 (1962) 181-186
4. Konno H., Yajima Y., and Maktkui T. Parametric simples algorithms for solving a special class of nonconvex minimization problems. Journal of Global Optimization 1 (1991) 65-81
5. Konno H., and Abe N. Minimization of the sum of three linear fractional functions. Journal of Global Optimization 15 (2002) 419-432
6. Kuno T. A branch and bound algorithm for maximizing the sum of several linear ratios. Journal of Global optimization 22 (2002) 155-174