A global optimization approach for solving generalized nonlinear multiplicative programming problem
type: Item
instance of: scholarly article
title: A global optimization approach for solving generalized nonlinear multiplicative programming problem
zbMATH Open document ID: 1474.90365
DOI: 10.1155/2014/641909
author: Linpeng Yang
author: Peiping Shen
author: Yonggang Pei
published in: Abstract and Applied Analysis
publication date: 2019-02-14T00:00:00Z
review text: Summary: This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set. The algorithm uses a branch and bound scheme based on an equivalently reverse convex programming problem. As a result, in the computation procedure the main work is solving a series of linear programs that do not grow in size from iterations to iterations. Further several key strategies are proposed to enhance solution production, and some of them can be used to solve a general reverse convex programming problem. Numerical results show that the computational efficiency is improved obviously by using these strategies.
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7022808
Wikidata QID: Q59040297
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/641909
OpenAlex ID: W2130777070
cites work: Generalized geometric programming applied to problems of optimal control. I: Theory
cites work: Effectiveness of a geometric programming algorithm for optimization of machining economics models
cites work: Restricted multinomial maximum likelihood estimation based upon Fenchel duality
cites work: Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
cites work: A stochastic geometric programming problem with multiplicative recourse
cites work: A quadratic programming approach to the multi-product newsvendor problem with side constraints
cites work: Allocation of resources in project management
cites work: Solving long-term financial planning problems via global optimization
cites work: Q4352213
cites work: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
cites work: \(NP\)-hardness of linear multiplicative programming and related problems
cites work: Global minimization of a generalized convex multiplicative function
cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization problems
cites work: A global optimization approach for solving the convex multiplicative programming problem
cites work: Linearization method for a class of multiplicative programming with exponent
cites work: Global optimization of multiplicative programs
cites work: A new rectangle branch-and-pruning approach for generalized geometric programming
cites work: A new linearization method for generalized linear multiplicative programming
cites work: A finite branch-and-bound algorithm for linear multiplicative programming
cites work: An outcome-space finite algorithm for solving linear multiplicative programming
cites work: An outer approximation method for minimizing the product of several convex functions on a convex set
cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
cites work: Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
cites work: Outcome-space cutting-plane algorithm for linear multiplicative programming
cites work: Multiplicative programming problems: Analysis and efficient point search heuristic
cites work: Heuristic methods for linear multiplicative programming
cites work: Global optimization for special reverse convex programming
description: scientific article; zbMATH DE number 7022808