On solving the sum-of-ratios problem
Webfor the Sum-of-Ratios Problem Yunchol Jong a a Center of Natural Sciences, University of Science, Pyongyang, DPR Korea July 22, 2012 Abstract. This paper presents a practical method for finding the globally optimal solution to the sum-of-ratios problem arising in image processing, engineering and management. Unlike traditional methods which may get Web1 de fev. de 2024 · Due to the intrinsic difficulty of problem (P), less work has been devoted to solving this problem. The proposed approach is based on reducing the original …
On solving the sum-of-ratios problem
Did you know?
Web1 de jun. de 2010 · The sum-of-ratios problems have numerous applications in economy and engineering. The sum-of-ratios problems are considered to be difficult, as these … WebNumerical experiments on problems up to sum of eight linear ratios with a thousand variables are reported. The results also show that solving the sum-of-ratios problem in …
Web1 de abr. de 2003 · A recent survey of applications, theoretical results and various algorithmic approaches for the sum-of-ratios problem is provided. One of the most difficult fractional programs encountered so far is the sum-of-ratios problem. Contrary to earlier expectations it is much more removed from convex programming than other multi-ratio …
Web13 de mai. de 2014 · This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set. Firstly, the problem (P) is converted to an equivalent problem (P1). Then, the initial nonconvex programming problem is reduced to a sequence of convex programming problems by … Web1 de jan. de 2002 · This article presents a branch-and-bound algorithm for globally solving the nonlinear sum of ratios problem (P). The algorithm economizes the required computations by conducting the branch-and-bound search in źp, rather than in źn, where p is the number of ratios in the objective function of problem (P) and n is the number of …
Web1 de fev. de 2024 · bib0011 H.P. Benson, Global optimization algorithm for the nonlinear sum of ratios problem, J. Optim. Theory Appl., 112 (2002) 1-29. Google Scholar Digital Library; bib0012 M. Dur, R. Horst, N.V. Thoai, Solving sum-of-ratios fractional programs using efficient points, Optimization, 49 (2001) 447-466. Google Scholar Cross Ref
Web1 de fev. de 2024 · The procedures for constructing nonconvex test problems with quadratic functions of any dimension, where global and local solutions are known are proposed, … megan sarah one life to live 1991WebMentioning: 10 - a b s t r a c tThe sum-of-ratios problems have numerous applications in economy and engineering. The sum-of-ratios problems are considered to be difficult, as these functions are highly nonconvex and multimodal. In this study, we propose a harmony search algorithm for solving a sum-of-ratios problem. Numerical examples are also … megan salisbury attorneyWebSuch problems are, in general, nonconvex (with numerous local extremums) and belong to a class of global optimization problems. First, we reduce a rather general fractional … nancy alcorn husbandWebSOLVING THE SUM-OF-RATIOS PROBLEM 85 2. Sum of one fraction and a convex function Throughout this section, we assume that pD1. In this case, problem.1/reduces … megan salmon-ferrari and tel still togetherWebFounded on the idea of subdividing the (p − 1)-dimensional output space, a branch-and-bound algorithm for solving the sum-of-linear-ratios(SLR) problem is proposed.First, a two-stage equivalent transformation method is adopted to obtain an equivalent problem(EP) for the problem SLR. megans at the hamletWebProblem (see [15, 16]).where , , , are randomly generated in ; are generated in ; , .In the investigated problem, denotes the number of the constraints, denotes the dimension of the problem, and denotes the number of ratios. From Table 1, compared with the known algorithms, numerical results indicate that the proposed algorithm can be used to globally … megan salois who-tvWebWe consider the problem of minimizing the sum of a convex function and of pý1 fractions subject to convex constraints. ... Solving the Sum-of-Ratios Problem by an Interior … megan sarah one life to live 1989