A branch-reduction-bound algorithm for linear fractional multi-product planning problems

DOI10.1007/S10878-025-01333-ZMaRDI QIDQ6937757zbMATH OpenFDO

Authors Xianfeng Ding, Meiling Hu

Publication date 26 August 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch-and-boundlinear relaxationlinear fractional multiple products

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A fully polynomial time approximation algorithm for linear fractional multiplicative programming problems
• A new global optimization approach for convex multiplicative programming
• A new linearization method for generalized linear multiplicative programming
• A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework
• A potential practical algorithm for minimizing the sum of affine fractional functions
• A practicable branch and bound algorithm for sum of linear ratios problem
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• An efficient algorithm for globally solving generalized linear multiplicative programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• Approximation of linear fractional-multiplicative problems
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• Image space analysis of generalized fractional programs
• Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
• Outer space branch and bound algorithm for solving linear multiplicative programming problems
• Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs

This page was built for publication: A branch-reduction-bound algorithm for linear fractional multi-product planning problems

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