Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
From MaRDI portal
Cites work
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A deterministic global optimization algorithm
- A global optimization algorithm for linear fractional programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- A neurodynamic optimization approach to supervised feature selection via fractional programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- 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 unified monotonic approach to generalized linear fractional programming
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Approximation of linear fractional-multiplicative problems
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global algorithm for solving linear multiplicative programming problems
- Global minimization of a generalized linear multiplicative programming
- Global optimization algorithm for solving linear multiplicative programming problems
- 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 signomial geometric programming problems
- Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
- Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
- Minimization of the sum of three linear fractional functions
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Solving generalized polynomial problem by using new affine relaxed technique
- Two-level linear relaxation method for generalized linear fractional programming
Cited in
(7)- Spatial algorithm for mixed integer generalized affine multiplicative problems
- A hybrid relaxation method for solving generalized linear fractional programs
- Reduced outer space algorithm for globally computing affine sum-of-ratios problems
- An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
- Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- An outer space approximation approach for generalized affine multiplicative programming problems
- A spatial global optimization algorithm for generalized fractional programming problems using second-order cone relaxation
This page was built for publication: Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7035385)
