Global minimization of a generalized linear multiplicative programming

From MaRDI portal
Publication:450102


DOI10.1016/j.apm.2011.09.002zbMath1246.90162MaRDI QIDQ450102

Chun-Feng Wang, Pei-Ping Shen, San-Yang Liu

Publication date: 13 September 2012

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.09.002


90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization


Related Items

Solving generalized polynomial problem by using new affine relaxed technique, Global optimization algorithm for solving linear multiplicative programming problems, Solving linear multiplicative programs via branch-and-bound: a computational experience, An accelerating outer space algorithm for globally solving generalized linear multiplicative problems, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, An accelerating algorithm for globally solving nonconvex quadratic programming, An efficient algorithm for globally solving generalized linear multiplicative programming, A parametric linearizing approach for quadratically inequality constrained quadratic programs, Range division and linearization algorithm for a class of linear ratios optimization problems, Global optimization for generalized linear multiplicative programming using convex relaxation, An out space accelerating algorithm for generalized affine multiplicative programs problem, Outer space branch and bound algorithm for solving linear multiplicative programming problems, Inner approximation algorithm for generalized linear multiplicative programming problems, Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems, Approximating a linear multiplicative objective in watershed management optimization, Global algorithm for solving linear multiplicative programming problems, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, Global optimization algorithm for a generalized linear multiplicative programming, A practicable branch-and-bound algorithm for globally solving linear multiplicative programming



Cites Work