Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Peiping Shen"'
Publikováno v:
Journal of Inequalities and Applications, Vol 2017, Iss 1, Pp 1-16 (2017)
Abstract This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve t
Externí odkaz:
https://doaj.org/article/bba78971fca042649d2a740e6a01fe14
Autor:
Peiping Shen, Chunfeng Wang
Publikováno v:
Journal of Inequalities and Applications, Vol 2017, Iss 1, Pp 1-11 (2017)
Abstract This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and d
Externí odkaz:
https://doaj.org/article/62ee76cba97c4efca68faeaedfed0443
Publikováno v:
Journal of Global Optimization. 86:303-321
Publikováno v:
Complex & Intelligent Systems. 8:4971-4991
Artificial bee colony (ABC) algorithm was proposed by mimicking the cooperative foraging behaviors of bees. As a member of swarm intelligence algorithms, ABC has some advantages in handling optimization problems. However, it has the exploration capac
Publikováno v:
Journal of Computational and Applied Mathematics. 426:115100
Publikováno v:
Numerical Algorithms; Jul2023, Vol. 93 Issue 3, p1373-1400, 28p
Publikováno v:
Optimization. 71:1421-1441
In this paper, a class of linear multiplicative problems (LMP) are considered, which cover many applications and are known to be NP-hard. For finding the globally optimal solution to problem (LMP) ...
Publikováno v:
Journal of Global Optimization. 78:453-482
In this paper, we consider a linear multiplicative programming problem (LMP) that is known to be NP-hard even with one product term. We first introduce the auxiliary variables to obtain an equivalent problem of problem LMP. An outer space branch and
Publikováno v:
Journal of Computational Science. 66:101931
Publikováno v:
European Journal of Operational Research. 278:36-48
In this paper, a practicable contraction approach is proposed for solving the sum of the generalized polynomial ratios problem (P) with generalized polynomial constraints. Due to the intrinsic difficulty of problem (P), less work has been devoted to