Global optimization for generalized linear multiplicative programming using convex relaxation
From MaRDI portal
Publication:1721616
DOI10.1155/2018/9146309zbMath1427.90237OpenAlexW2802584952WikidataQ129831066 ScholiaQ129831066MaRDI QIDQ1721616
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/9146309
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Linear programming (90C05)
Related Items (7)
Global optimization algorithm for solving linear multiplicative programming problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Uses Software
Cites Work
- Unnamed Item
- Global minimization of a generalized linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- A new rectangle branch-and-pruning approach for generalized geometric programming
- Global maximization of a generalized concave multiplicative function
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Vector maximization with two objective functions
- A mean-absolute deviation-skewness portfolio optimization model
- Bilinear separation of two sets in \(n\)-space
- Optimization on low rank nonconvex structures
- Conical partition algorithm for maximizing the sum of dc ratios
- Fuzzy pricing, marketing and service planning in a fuzzy inventory model: a geometric programming approach
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A deterministic global optimization algorithm for generalized geometric programming
- A bilinear programming formulation of the 3-dimensional assignment problem
- A linear max—min problem
- Robust Optimization of Large-Scale Systems
- Equilibrium Points of Bimatrix Games
- Solving Bicriterion Mathematical Programs
- Convex analysis and global optimization
This page was built for publication: Global optimization for generalized linear multiplicative programming using convex relaxation
