Two-level linear relaxation method for generalized linear fractional programming

DOI10.1007/S40305-021-00375-4MaRDI QIDQ6047583zbMATH OpenOpenAlexFDO

Authors Hong-Wei Jiao, Youlin 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

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

Recommendations

• A new approach for solving generalized linear fractional programming
• A global optimization algorithm for linear fractional programming
• Global optimization of generalized linear fractional programming with nonlinear constraints
• An efficient algorithm for solving a class of fractional programming problems

Cites work

• scientific article; zbMATH DE number 1095224 (Why is no real title available?)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A deterministic global optimization algorithm for generalized geometric programming
• A global optimization algorithm for linear fractional programming
• A global optimization algorithm for sum of linear ratios problem
• A new linearization method for generalized linear multiplicative programming
• A new two-level linear relaxed bound method for geometric programming problems
• A practicable branch and bound algorithm for sum of linear ratios problem
• A practicable contraction approach for the sum of the generalized polynomial ratios problem
• A unified monotonic approach to generalized linear fractional programming
• Accelerating method of global optimization for signomial geometric programming
• An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
• An outcome-space finite algorithm for solving linear multiplicative programming
• Branch-reduction-bound algorithm for generalized geometric programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Global optimization algorithm for a generalized linear multiplicative programming
• Global optimization for sum of generalized fractional functions
• Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
• Global optimization of generalized linear fractional programming with nonlinear constraints
• Global optimization of multiplicative programs
• Global optimization of signomial geometric programming using linear relaxation.
• Linearization method for a class of multiplicative programming with exponent
• Linearization method of global optimization for generalized geometric programming
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• Range division and linearization algorithm for a class of linear ratios optimization problems

Cited in

(18)

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
• A novel affine relaxation-based algorithm for minimax affine fractional program
• An efficient algorithm via a novel one-parameter filled function based on general univariate functions for unconstrained global optimization
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
• Global algorithm for effectively solving min-max affine fractional programs
• Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
• An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
• Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
• Spatial algorithm for mixed integer generalized affine multiplicative problems
• A novel branch-and-bound algorithm for minimizing a class of generalized sum of linear ratio programming problems
• A new global optimization method based on separable relaxation for solving sum of linear ratios problem
• A hybrid relaxation method for solving generalized linear fractional programs
• Globally minimizing a class of fractional multiplicative problems using the separability of relaxation problem
• An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
• Reduced outer space algorithm for globally computing affine sum-of-ratios problems
• An outer space approximation approach for generalized affine multiplicative programming problems
• An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs

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

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