The nonlinear sum of ratios problem (P) has several important applications. However, it is also a difficult problem to solve, since it generally possesses many local optima that are not global optima. In this article we present and show the convergence of an algorithm for finding a global optimal so
A PTAS for capacitated sum-of-ratios optimization
β Scribed by Paat Rusmevichientong; Zuo-Jun Max Shen; David B. Shmoys
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 603 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper considers the solution of generalized fractional programming (GFP) problem which contains various variants such as a sum or product of a finite number of ratios of linear functions, polynomial fractional programming, generalized geometric programming, etc. over a polytope. For such proble
This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh
Our concern in this paper is a detection of a change in regression coefficients of a linear model. First, we examine the null and alternative distributions of the likelihood ratio statistic and study its asymptotic behavior. We then propose analytic approximations for the \(p\)-value and power of th