A global optimization approach for solving generalized nonlinear multiplicative programming problem
From MaRDI portal
Publication:1724645
DOI10.1155/2014/641909zbMath1474.90365OpenAlexW2130777070WikidataQ59040297 ScholiaQ59040297MaRDI QIDQ1724645
Lin-Peng Yang, Pei-Ping Shen, Yong Gang Pei
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/641909
Related Items (5)
Global optimization algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
Cites Work
- Unnamed Item
- A new linearization method for generalized linear multiplicative programming
- An outer approximation method for minimizing the product of several convex functions on a convex set
- An outcome-space finite algorithm for solving linear multiplicative programming
- A quadratic programming approach to the multi-product newsvendor problem with side constraints
- Linearization method for a class of multiplicative programming with exponent
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A stochastic geometric programming problem with multiplicative recourse
- Global optimization for special reverse convex programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Global minimization of a generalized convex multiplicative function
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Solving long-term financial planning problems via global optimization
- Global optimization of multiplicative programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- \(NP\)-hardness of linear multiplicative programming and related problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Allocation of resources in project management
- A finite branch-and-bound algorithm for linear multiplicative programming
This page was built for publication: A global optimization approach for solving generalized nonlinear multiplicative programming problem
