Global optimization for generalized linear multiplicative programming using convex relaxation
From MaRDI portal
Summary: Applications of generalized linear multiplicative programming problems (LMP) can be frequently found in various areas of engineering practice and management science. In this paper, we present a simple global optimization algorithm for solving linear multiplicative programming problem (LMP). The algorithm is developed by a fusion of a new convex relaxation method and the branch and bound scheme with some accelerating techniques. Global convergence and optimality of the algorithm are also presented and extensive computational results are reported on a wide range of problems from recent literature and GLOBALLib. Numerical experiments show that the proposed algorithm with a new convex relaxation method is more efficient than usual branch and bound algorithm that used linear relaxation for solving the LMP.
Recommendations
- Global minimization of a generalized linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization method for linear multiplicative programming
- A global optimization approach for solving the convex multiplicative programming problem
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A new global optimization approach for convex multiplicative programming
- A global optimization using linear relaxation for generalized geometric programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- scientific article; zbMATH DE number 1225234
- Global optimization of linear multiplicative programming using univariate search
Cites work
- A bilinear programming formulation of the 3-dimensional assignment problem
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A deterministic global optimization algorithm for generalized geometric programming
- A global optimization approach for solving the convex multiplicative programming problem
- A linear max—min problem
- A mean-absolute deviation-skewness portfolio optimization model
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Bilinear separation of two sets in n-space
- Conical partition algorithm for maximizing the sum of dc ratios
- Convex analysis and global optimization
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Equilibrium Points of Bimatrix Games
- Fuzzy pricing, marketing and service planning in a fuzzy inventory model: a geometric programming approach
- Global maximization of a generalized concave multiplicative function
- Global minimization of a generalized linear multiplicative programming
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- Linearization method for a class of multiplicative programming with exponent
- Optimization on low rank nonconvex structures
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Robust Optimization of Large-Scale Systems
- Solving Bicriterion Mathematical Programs
- Vector maximization with two objective functions
Cited in
(21)- A linearized relaxing algorithm for the specific nonlinear optimization problem
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Global optimization reduction of generalized Malfatti's problem
- A global optimization using linear relaxation for generalized geometric programming
- An -approximation algorithm for generalized fractional programming problems
- Global optimization algorithm for solving linear multiplicative programming problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- scientific article; zbMATH DE number 7705675 (Why is no real title available?)
- A new linearization method for generalized linear multiplicative programming
- 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 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 outcome space algorithm for solving general linear multiplicative programming
- Globally minimizing a class of linear multiplicative programming under the flexible branching scheme
- A new global optimization approach for convex multiplicative programming
This page was built for publication: Global optimization for generalized linear multiplicative programming using convex relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721616)
