Two-level linear relaxation method for generalized linear fractional programming

DOI10.1007/S40305-021-00375-4OpenAlexW4205854323MaRDI QIDQ6047583

Hong-Wei Jiao, You-lin Shang

Publication date: 12 September 2023

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-021-00375-4

zbMATH Keywords

global optimizationbranch-and-boundgeneralized linear fractional programmingtwo-level linear relaxation method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Cites Work

• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• A global optimization algorithm for sum of linear ratios problem
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• A new linearization method for generalized linear multiplicative programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• Linearization method for a class of multiplicative programming with exponent
• Global optimization of generalized linear fractional programming with nonlinear constraints
• Global optimization of multiplicative programs
• A unified monotonic approach to generalized linear fractional programming
• Global optimization of signomial geometric programming using linear relaxation.
• Range division and linearization algorithm for a class of linear ratios optimization problems
• Linearization method of global optimization for generalized geometric programming
• A new two-level linear relaxed bound method for geometric programming problems
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• A global optimization algorithm for linear fractional programming
• Branch-reduction-bound algorithm for generalized geometric programming
• A practicable contraction approach for the sum of the generalized polynomial ratios problem
• Global optimization for sum of generalized fractional functions
• Accelerating method of global optimization for signomial geometric programming
• Global optimization algorithm for a generalized linear multiplicative programming
• Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A deterministic global optimization algorithm for generalized geometric programming
• An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem

This page was built for publication: Two-level linear relaxation method for generalized linear fractional programming