A practicable branch and bound algorithm for sum of linear ratios problem

@article{Jiao2015APB,
  title={A practicable branch and bound algorithm for sum of linear ratios problem},
  author={Hong-Wei Jiao and San-Yang Liu},
  journal={European Journal of Operational Research},
  year={2015},
  volume={243},
  pages={723-730}
}
This article presents a practicable algorithm for globally solving sum of linear ratios problem (SLR). The algorithm works by globally solving a bilinear programming problem (EQ) that is equivalent to the problem (SLR). In the algorithm, by utilizing convex envelope and concave envelope of bilinear function, the initial nonconvex programming problem is reduced to a sequence of linear relaxation programming problems. In order to improve the computational efficiency of the algorithm, a new… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 53 references

A branch & cut technique to solve a weighted-sum of linear ratios

  • J. P. Costa
  • Pacific Journal of Optimization,
  • 2010
Highly Influential
5 Excerpts

Global optimization algorithm for the nonlinear sum of ratios problem

  • H. P. Benson
  • Journal of Optimization Theory and Applications,
  • 2002
Highly Influential
8 Excerpts

Algorithm research for two kinds of fractional programming problems (Master Degree Dissertation). Northwest University of Nationalities

  • H. in
  • cCormick, G. P
  • 2008
Highly Influential
2 Excerpts

Global optimization algorithm for sum of generalized polynomial ratios problem

  • H. iao, Z. Wang, Y. Chen
  • Applied Mathematical Modelling,
  • 2013

Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region

  • Y. ei, D. Zhu
  • Journal of Applied Mathematics and Computing,
  • 2013

Similar Papers

Loading similar papers…