Solving generalized polynomial problem by using new affine relaxed technique
From MaRDI portal
Publication:5063453
DOI10.1080/00207160.2021.1909727zbMath1499.90277OpenAlexW3151568068MaRDI QIDQ5063453
Hong-Wei Jiao, Wenjie Wang, You-lin Shang
Publication date: 21 March 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2021.1909727
global optimizationbranch-and-boundfractional programmingaffine relaxed techniquegeneralized polynomial problem
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Related Items
Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ Generalized polynomial exponential sums and their fourth power mean ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practicable branch and bound algorithm for sum of linear ratios problem
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Global minimization of a generalized linear multiplicative programming
- Linear decomposition approach for a class of nonconvex programming problems
- A new linearization method for generalized linear multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- A new reformulation-linearization technique for bilinear programming problems
- Convex extensions and envelopes of lower semi-continuous functions
- Global optimization of multiplicative programs
- A unified monotonic approach to generalized linear fractional programming
- Global optimization of signomial geometric programming using linear relaxation.
- A hybrid LP/NLP paradigm for global optimization relaxations
- The Boolean quadratic programming problem with generalized upper bound constraints
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Global optimization of nonconvex problems with convex-transformable intermediates
- Linearization method of global optimization for generalized geometric programming
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- The expansion of functions under transformation and its application to optimization
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Global algorithm for solving linear multiplicative programming problems
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization of nonconvex problems with multilinear intermediates
- Branch-reduction-bound algorithm for generalized geometric programming
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- Relaxations of factorable functions with convex-transformable intermediates
- Accelerating method of global optimization for signomial geometric programming
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A deterministic global optimization algorithm for generalized geometric programming
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A eighth bibliography of fractional programming
- Fractional programming: The sum-of-ratios case
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Quadratically constrained quadratic programming: Some applications and a method for solution
- A Cutting Plane Approach for Chance Constrained Linear Programs
- An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Analysis of bounds for multilinear functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
