Global optimization algorithm for a generalized linear multiplicative programming
From MaRDI portal
Recommendations
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Global optimization algorithm for solving linear multiplicative programming problems
Cites work
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- scientific article; zbMATH DE number 3231717 (Why is no real title available?)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A decomposition algorithm for solving large-scale quadratic programming problems
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- A new accelerating method for globally solving a class of nonconvex programming problems
- A new linearization method for generalized linear multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A numerical solution method to interval quadratic programming
- A parametric successive underestimation method for convex multiplicative programming problems
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A unified monotonic approach to generalized linear fractional programming
- An outcome space approach for generalized convex multiplicative programs
- An outcome-space finite algorithm for solving linear multiplicative programming
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Finite algorithm for generalized linear multiplicative programming
- Generalized convex multiplicative programming via quasiconcave minimization
- Global maximization of a generalized concave multiplicative function
- Global minimization of a generalized convex multiplicative function
- Global minimization of a generalized linear multiplicative programming
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Global optimization of multiplicative programs
- Heuristic methods for linear multiplicative programming
- Linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- Optimization on low rank nonconvex structures
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Robust Optimization of Large-Scale Systems
- Solving long-term financial planning problems via global optimization
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(32)- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- 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
- Global optimization algorithm for solving linear multiplicative programming problems
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- A new linearization method for generalized linear multiplicative programming
- A new branch and bound method for solving linear multiplicative programming problems
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- A branch and bound reduction algorithm for solving a class of linear multiplicative programming problems with constant coefficients
- Global algorithm for solving linear multiplicative programming problems
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Two-level linear relaxation method for generalized linear fractional programming
- Global optimization reduction of generalized Malfatti's problem
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- Global minimization of a generalized linear multiplicative programming
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Approximating a linear multiplicative objective in watershed management optimization
- An efficient algorithm for computing a class of multiplicative optimization problem
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- scientific article; zbMATH DE number 6311514 (Why is no real title available?)
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
- Global optimization for generalized linear multiplicative programming using convex relaxation
This page was built for publication: Global optimization algorithm for a generalized linear multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2511121)
