Global optimization for sum of generalized fractional functions

DOI10.1016/j.cam.2007.01.022zbMath1144.65043OpenAlexW1995661606MaRDI QIDQ2479363

Chun-Feng Wang, Pei-Ping Shen

Publication date: 26 March 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2007.01.022

zbMATH Keywords

algorithmglobal optimizationconvergencelinearizationnumerical examplesbranch and boundlinear relaxationgeneralized geometric programminggeneralized fractional programmingpolynomial fractional programming

Mathematics Subject Classification ID

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

Related Items (11)

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Maximizing for the sum of ratios of two convex functions over a convex set ⋮ Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem ⋮ Solving the sum-of-ratios problems by a harmony search algorithm ⋮ A deterministic method for solving the sum of linear ratios problem

Cites Work

• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• On the global optimization of sums of linear fractional functions over a convex set
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Dual estimates in multiextremal problems
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• Global optimization of nonconvex polynomial programming problems having rational exponents
• A unified monotonic approach to generalized linear fractional programming
• Global optimization of signomial geometric programming using linear relaxation.
• Minimization of the sum of three linear fractional functions
• Global optimization for sum of linear ratios problem with coefficients
• Global Optimization with Polynomials and the Problem of Moments
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• Convex analysis and global optimization
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

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