A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems

DOI10.1007/S10898-023-01358-WMaRDI QIDQ6568950FDOQ6568950

Hong-Wei Jiao, Wenqiang Yang, Binbin Li

Publication date: 8 July 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

computational complexityglobal optimizationbranch-reduction-bound algorithmcriterion-space region reduction technologiesgeneralized multiplicative problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Title not available (Why is that?)
• Fractional programming
• Global optimization of signomial geometric programming using linear relaxation.
• A global optimization algorithm for linear fractional programming
• Global optimization of multiplicative programs
• Heuristic methods for linear multiplicative programming
• A finite branch-and-bound algorithm for linear multiplicative programming
• A unified monotonic approach to generalized linear fractional programming
• Linearization method of global optimization for generalized geometric programming
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Global optimization of generalized linear fractional programming with nonlinear constraints
• A hybrid LP/NLP paradigm for global optimization relaxations
• Image space analysis of generalized fractional programs
• Linear-fractional programming. Theory, methods, applications and software.
• Global optimization for sum of generalized fractional functions
• Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A deterministic global optimization algorithm for generalized geometric programming
• A practicable branch and bound algorithm for sum of linear ratios problem
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• Solving long-term financial planning problems via global optimization
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Finite algorithm for generalized linear multiplicative programming
• A new linearization method for generalized linear multiplicative programming
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• An outcome-space finite algorithm for solving linear multiplicative programming
• Global minimization of a generalized linear multiplicative programming
• Approximation of linear fractional-multiplicative problems
• Geometric Programming: Methods, Computations and Applications
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• A nonisolated optimal solution of general linear multiplicative programming problems
• A new two-level linear relaxed bound method for geometric programming problems
• An efficient algorithm for globally solving generalized linear multiplicative programming
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
• An objective space cut and bound algorithm for convex multiplicative programmes
• Range division and linearization algorithm for a class of linear ratios optimization problems
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications
• Effective algorithm and computational complexity for solving sum of linear ratios problem
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• Title not available (Why is that?)
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem
• A potential practical algorithm for minimizing the sum of affine fractional functions
• Two-level linear relaxation method for generalized linear fractional programming

Cited In (2)

• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
• Global algorithm for effectively solving min-max affine fractional programs

This page was built for publication: A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems

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