Global optimization algorithm for solving linear multiplicative programming problems
From MaRDI portal
Recommendations
- Global algorithm for solving linear multiplicative programming problems
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization method for linear multiplicative programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Global optimal algorithm for linear programming problems subjected to nonlinear constraints
- A global optimization algorithm for solving linear multilevel programming problem
- Global optimization of linear multiplicative programming using univariate search
- Global optimization algorithm for solving sum of linear ratios problems
- Global optimization of multiplicative programs
- Global optimization method for solving mathematical programs with linear complementarity constraints
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A method of acceleration for a class of multiplicative programming problems with exponent
- A new global optimization approach for convex multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An FPTAS for minimizing the product of two non-negative linear cost functions
- An outcome space approach for generalized convex multiplicative programs
- An outer approximation method for minimizing the product of several convex functions on a convex set
- BARON: A general purpose global optimization software package
- Bilinear separation of two sets in n-space
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Convex analysis and global optimization
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Finite algorithm for generalized linear multiplicative programming
- Generalized convexity and optimization. Theory and applications
- Global algorithm for solving linear multiplicative programming problems
- 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 algorithm for a generalized linear multiplicative programming
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Global optimization of a rank-two nonconvex program
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Heuristic methods for linear multiplicative programming
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- Introduction to global optimization
- Linear decomposition approach for a class of nonconvex programming problems
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the minimization of a class of generalized linear functions on a flow polytope
- Optimization on low rank nonconvex structures
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Practical global optimization for multiview geometry
- Range division and contraction algorithm for a class of global optimization problems
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Robust Optimization of Large-Scale Systems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- Solving long-term financial planning problems via global optimization
Cited in
(28)- Global algorithm for solving linear multiplicative programming problems
- Global optimization method for linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- The global solver in the LINDO API
- scientific article; zbMATH DE number 4158385 (Why is no real title available?)
- Global optimization of linear multiplicative programming using univariate search
- A global optimization for a class of multiplicative programming problems
- A global optimization algorithm for solving linear multilevel programming problem
- scientific article; zbMATH DE number 7668283 (Why is no real title available?)
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- A criterion space algorithm for solving linear multiplicative programming problems
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- A novel branch and bound algorithm for solving the linear multiplicative programming problems
- An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs
- A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework
- A new branch and bound method for solving linear multiplicative programming problems
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
- Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- An outer space approximation approach for generalized affine multiplicative programming problems
- An efficient algorithm for globally solving generalized linear multiplicative programming
This page was built for publication: Global optimization algorithm for solving linear multiplicative programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085229)
