A new two-level linear relaxed bound method for geometric programming problems
From MaRDI portal
Publication:1774846
DOI10.1016/j.amc.2004.04.027zbMath1069.65064OpenAlexW1972087617MaRDI QIDQ1774846
Yuelin Gao, Lian-Sheng Zhang, Cheng-Xian Xu, Yan-Jun Wang
Publication date: 4 May 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.04.027
AlgorithmGlobal optimizationBranch-and-bound methodGeometric programmingLinearization techniqueRelaxed approximation
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items (4)
Computational method for the profit bounds of inventory model with interval demand and unit cost ⋮ Using geometric arithmetic mean to solve non-linear fractional programming problems ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ Fuzzy profit measures for a fuzzy economic order quantity model
Cites Work
- An outer approximation method for minimizing the product of several convex functions on a convex set
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
- Reversed geometric programming: A branch-and-bound method involving linear subproblems
- Reduction of indefinite quadratic programs to bilinear programs
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new reformulation-linearization technique for bilinear programming problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- Generalized convex multiplicative programming via quasiconcave minimization
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Global optimization of nonconvex polynomial programming problems having rational exponents
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Finite algorithm for generalized linear multiplicative programming
- Generalized linear multiplicative and fractional programming
- Jointly Constrained Biconvex Programming
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
This page was built for publication: A new two-level linear relaxed bound method for geometric programming problems
