Global optimization algorithm for solving linear multiplicative programming problems
From MaRDI portal
Publication:5085229
DOI10.1080/02331934.2020.1812603zbMATH Open1489.90141OpenAlexW3083412729MaRDI QIDQ5085229FDOQ5085229
Authors: Kai-Min Wang, Ting Lu, Peiping Shen 
Publication date: 27 June 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1812603
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
computational complexityglobal optimizationbranch and boundlinear multiplicative programminglinear relaxation technique
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- BARON: A general purpose global optimization software package
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Robust Optimization of Large-Scale Systems
- Title not available (Why is that?)
- Practical global optimization for multiview geometry
- Introduction to global optimization
- Range division and contraction algorithm for a class of global optimization problems
- Convex analysis and global optimization
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Heuristic methods for linear multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Bilinear separation of two sets in \(n\)-space
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Generalized convexity and optimization. Theory and applications
- Linear decomposition approach for a class of nonconvex programming problems
- Solving long-term financial planning problems via global optimization
- Optimization on low rank nonconvex structures
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Finite algorithm for generalized linear multiplicative programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- Global minimization of a generalized convex multiplicative function
- Global minimization of a generalized linear multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
- Global optimization of a rank-two nonconvex program
- Title not available (Why is that?)
- Global maximization of a generalized concave multiplicative function
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- An outer approximation method for minimizing the product of several convex functions on a convex set
- A nonisolated optimal solution of general linear multiplicative programming problems
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Global algorithm for solving linear multiplicative programming problems
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A new global optimization approach for convex multiplicative programming
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Global optimization algorithm for a generalized linear multiplicative programming
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- On the minimization of a class of generalized linear functions on a flow polytope
Cited In (19)
- 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 of linear multiplicative programming using univariate search
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- Global optimization algorithm for a generalized linear multiplicative programming
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- The global solver in the LINDO API
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- Global algorithm for solving linear multiplicative programming problems
- Global optimization method for linear multiplicative programming
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A global optimization for a class of 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 global optimization algorithm for solving linear multilevel programming problem
Uses Software
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)
