A new two-level linear relaxed bound method for geometric programming problems
type: Item
instance of: scholarly article
title: A new two-level linear relaxed bound method for geometric programming problems
zbMATH Open document ID: 1069.65064
author: Yuelin Gao
author: Cheng-Xian Xu
author: Yanjun Wang
author: Liansheng Zhang
published in: Applied Mathematics and Computation
publication date: 2005-05-04T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2165263
zbMATH Keywords: Geometric programming
zbMATH Keywords: Algorithm
zbMATH Keywords: Global optimization
zbMATH Keywords: Linearization technique
zbMATH Keywords: Branch-and-bound method
zbMATH Keywords: Relaxed approximation
MaRDI profile type: Publication
full work available at URL: j.amc.2004.04.027
OpenAlex ID: W1972087617
cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
cites work: Generalized convex multiplicative programming via quasiconcave minimization
cites work: Multiplicative programming problems: Analysis and efficient point search heuristic
cites work: Generalized linear multiplicative and fractional programming
cites work: BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
cites work: An outer approximation method for minimizing the product of several convex functions on a convex set
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Finite algorithm for generalized linear multiplicative programming
cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
cites work: Jointly Constrained Biconvex Programming
cites work: A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
cites work: Reversed geometric programming: A branch-and-bound method involving linear subproblems
cites work: Reduction of indefinite quadratic programs to bilinear programs
cites work: Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: Global optimization of nonconvex polynomial programming problems having rational exponents
DOI: 10.1016/J.AMC.2004.04.027
Recommended article: Q3570925
Recommended article: A global optimization using linear relaxation for generalized geometric programming
Recommended article: Q3196009
Recommended article: A new algorithm for geometric programming based on the linear structure of its dual problem.
Recommended article: Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
Recommended article: Q4454073
Recommended article: Q4393272
Recommended article: A geometric method for a class of convex programs
Recommended article: Q4803773
Recommended article: Q3217956
description: scientific article; zbMATH DE number 2165263