full
search.png

Search

close.png

Cancel

arrow
Volume 22, Issue 6
A Branch and Bound Algorithm for Separable Concave Programming

Honggang Xue, Chengxian Xu & Fengmin Xu

J. Comp. Math., 22 (2004), pp. 895-904.

Published online: 2004-12

Preview Full PDF 3160 27370

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision (NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than $w$-subdivision method.

  • Keywords

Branch and bound algorithm, Separable programming, Largest distance bisection, Normal rectangle subdivision, $w$-subdivision.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-22-895, author = {Xue , HonggangXu , Chengxian and Xu , Fengmin}, title = {A Branch and Bound Algorithm for Separable Concave Programming}, journal = {Journal of Computational Mathematics}, year = {2004}, volume = {22}, number = {6}, pages = {895--904}, abstract = {

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision (NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than $w$-subdivision method.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/10293.html} }
TY - JOUR T1 - A Branch and Bound Algorithm for Separable Concave Programming AU - Xue , Honggang AU - Xu , Chengxian AU - Xu , Fengmin JO - Journal of Computational Mathematics VL - 6 SP - 895 EP - 904 PY - 2004 DA - 2004/12 SN - 22 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/10293.html KW - Branch and bound algorithm, Separable programming, Largest distance bisection, Normal rectangle subdivision, $w$-subdivision. AB -

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision (NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than $w$-subdivision method.

Xue , HonggangXu , Chengxian and Xu , Fengmin. (2004). A Branch and Bound Algorithm for Separable Concave Programming. Journal of Computational Mathematics. 22 (6). 895-904. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard