Inner approximation algorithm for generalized linear multiplicative programming problems
From MaRDI portal
Publication:2061502
DOI10.1186/s13660-018-1947-9zbMath1498.90177OpenAlexW2904588395WikidataQ60944138 ScholiaQ60944138MaRDI QIDQ2061502
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1947-9
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items (2)
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound ⋮ Approximating a linear multiplicative objective in watershed management optimization
Cites Work
- Global optimization of signomial geometric programming problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Global minimization of a generalized linear multiplicative programming
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A tutorial on geometric programming
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- A unified monotonic approach to generalized linear fractional programming
- Global optimization of signomial geometric programming using linear relaxation.
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A method of acceleration for a class of multiplicative programming problems with exponent
- Branch-reduction-bound algorithm for generalized geometric programming
- Global optimization for sum of linear ratios problem with coefficients
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- Geometric Programming: Methods, Computations and Applications
- Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
- Optimal design of a membrane separation process using signomial programming
- Mathematical Programming Models for Environmental Quality Control
- Digital Circuit Optimization via Geometric Programming
- Generalized Weighted Mean Programming
- Chapter 7: The specialized MINLP approach
This page was built for publication: Inner approximation algorithm for generalized linear multiplicative programming problems
