A new linearization method for generalized linear multiplicative programming
From MaRDI portal
Publication:622153
DOI10.1016/j.cor.2010.10.016zbMath1208.90162OpenAlexW2024988725MaRDI QIDQ622153
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.016
Related Items
Solving generalized polynomial problem by using new affine relaxed technique ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ A branch-and-reduce approach for solving generalized linear multiplicative programming ⋮ A practicable branch-and-bound algorithm for globally solving linear multiplicative programming ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ Linear decomposition approach for a class of nonconvex programming problems ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- A new accelerating method for globally solving a class of nonconvex programming problems
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Generalized concavity
- A global optimization approach for solving the convex multiplicative programming problem
- A mean-absolute deviation-skewness portfolio optimization model
- Image space analysis of generalized fractional programs
- Global optimization of multiplicative programs
- A unified monotonic approach to generalized linear fractional programming
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Finding GM-estimators with global optimization techniques
- DC programming: overview.
- A method of acceleration for a class of multiplicative programming problems with exponent
- A new efficient algorithm based on DC programming and DCA for clustering
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Some representation theorems for functions and sets and their application to nonlinear programming
- Robust Optimization of Large-Scale Systems
- On covering method for d.c. optimization.
- A finite branch-and-bound algorithm for linear multiplicative programming
