Minimization of the Ratio of Functions Defined as Sums of the Absolute Values |
| |
Authors: | H. Konno K. Tsuchiya R. Yamamoto |
| |
Affiliation: | (1) Department of Industrial and Systems Engineering, Chuo University, Tokyo, Japan;(2) Mitsubishi UFJ Trust Investment Technology Institute Company, Tokyo, Japan |
| |
Abstract: | This paper addresses a new class of linearly constrained fractional programming problems where the objective function is defined as the ratio of two functions which are the sums of the absolute values of affine functions. This problem has an important application in financial optimization. This problem is a convex-convex type of fractional program which cannot be solved by standard algorithms. We propose a branch-and-bound algorithm and an integer programming algorithm. We demonstrate that a fairly large scale problem can be solved within a practical amount of time. The research of the first author was supported in part by the Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Culture and Sports of the Government of Japan, B(2) 15310122 and 15656025. |
| |
Keywords: | Fractional programming problems Global optimization Branch and bound algorithms 0-1 integer programming Portfolio optimization |
本文献已被 SpringerLink 等数据库收录! |