Minimization of the ratio of functions defined as sums of the absolute values

H. Konno, K. Tsuchiya, R. Yamamoto

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)399-410
Number of pages12
JournalJournal of Optimization Theory and Applications
Issue number3
Publication statusPublished - 2007 Dec
Externally publishedYes


  • 0-1 integer programming
  • Branch and bound algorithms
  • Fractional programming problems
  • Global optimization
  • Portfolio optimization

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'Minimization of the ratio of functions defined as sums of the absolute values'. Together they form a unique fingerprint.

Cite this