Global optimization for sum of geometric fractional functions

DOI10.1016/J.AMC.2010.03.061MaRDI QIDQ983970zbMATH OpenOpenAlexFDO

Authors Chunfeng Wang, Peiping Shen, Sanyang Liu

Publication date 13 July 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2010.03.061

zbMATH Keywords

branch and bound algorithmconvergencefractional functionglobal optimizationlinear relaxationnumerical resultssum-of-ratios

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Global optimization for the sum of generalized polynomial fractional functions
• Global optimization for sum of generalized fractional functions
• Global optimization of generalized linear fractional programming with nonlinear constraints
• scientific article; zbMATH DE number 6179040
• On the global optimization of sums of linear fractional functions over a convex set

Cites work

• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Global minimization of a generalized convex multiplicative function
• Global optimization algorithm for the nonlinear sum of ratios problem
• Global optimization for the sum of generalized polynomial fractional functions
• Global optimization of nonconvex polynomial programming problems having rational exponents
• Global optimization of nonlinear sum of ratios problem
• Global optimization of signomial geometric programming using linear relaxation.
• Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
• Minimization of the sum of three linear fractional functions
• On the posynomial fractional programming problems
• Solving the sum-of-ratios problem by an interior-point method
• Using concave envelopes to globally solve the nonlinear sum of ratios problem

Cited in

(9)

• Global optimization for the sum of certain nonlinear functions
• A parametric solution method for a generalized fractional programming problem
• Using geometric arithmetic mean to solve non-linear fractional programming problems
• Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
• Global optimization for the sum of generalized polynomial fractional functions
• Global optimization for sum of generalized fractional functions
• Minimizing the sum of many rational functions
• A potential practical algorithm for minimizing the sum of affine fractional functions
• On the global optimization of sums of linear fractional functions over a convex set

This page was built for publication: Global optimization for sum of geometric fractional functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983970)