An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
From MaRDI portal
Publication:6093979
Recommendations
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Global algorithm for solving linear multiplicative programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
- Outcome-space outer approximation algorithm for linear multiplicative programming
- An accelerating algorithm for a class of multiplicative programming
- A full polynomial time approximation algorithm for generalized linear multiplicative problems
- An outcome-space finite algorithm for solving linear multiplicative programming
Cites work
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A finite branch-and-bound algorithm for linear multiplicative programming
- A global optimization algorithm for linear fractional programming
- A global optimization approach for solving the convex multiplicative programming problem
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A new solution method for a class of large dimension rank-two nonconvex programs
- A nonisolated optimal solution of general linear multiplicative programming problems
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- A robust algorithm for generalized geometric programming
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A tutorial on geometric programming
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Bilinear separation of two sets in \(n\)-space
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- 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
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- Global minimization of a generalized convex multiplicative function
- Global minimization of a generalized linear multiplicative programming
- 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
- Image space analysis of generalized fractional programs
- Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
- On the minimization of a class of generalized linear functions on a flow polytope
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- 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
- Robust Optimization of Large-Scale Systems
- Solving generalized polynomial problem by using new affine relaxed technique
- Underestimation functions for a rank-two partitioning method
Cited in
(4)- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- A criterion space algorithm for solving linear multiplicative programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- An out space accelerating algorithm for generalized affine multiplicative programs problem
This page was built for publication: An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093979)
