Solving a class of geometric programming problems by an efficient dynamic model

DOI10.1016/j.cnsns.2012.07.016zbMath1311.90143OpenAlexW2028301726MaRDI QIDQ391472

Alireza Nazemi, Elahe Sharifi

Publication date: 10 January 2014

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1007570412003280?np=y

zbMATH Keywords

stabilityneural networkconvex programminggeometric programmingconvergent

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (6)

A practical nonlinear dynamic framework for solving a class of fractional programming problems ⋮ Using geometric arithmetic mean to solve non-linear fractional programming problems ⋮ Nonlinear fractional optimal control problems with neural network and dynamic optimization schemes ⋮ A computational intelligence method for solving a class of portfolio optimization problems ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models

This page was built for publication: Solving a class of geometric programming problems by an efficient dynamic model