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

DOI10.1016/J.CNSNS.2012.07.016MaRDI QIDQ391472zbMATHOpenAlexFDO

Authors 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

stabilityconvex programmingneural networkconvergentgeometric programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A dynamic system model for solving convex nonlinear optimization problems
• A practical nonlinear dynamic framework for solving a class of fractional programming problems
• scientific article; zbMATH DE number 1497340
• A new nonlinear neural network for solving convex nonlinear programming problems
• Application of projection neural network in solving convex programming problems

Cited in

(8)

• A computational intelligence method for solving a class of portfolio optimization problems
• Geometric programming solution of second degree difficulty for carbon ejection controlled reliable smart production system
• scientific article; zbMATH DE number 3916034 (Why is no real title available?)
• A novel optimization method for nonconvex quadratically constrained quadratic programs
• Using geometric arithmetic mean to solve non-linear fractional programming problems
• An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models
• A practical nonlinear dynamic framework for solving a class of fractional programming problems
• Nonlinear fractional optimal control problems with neural network and dynamic optimization schemes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391472)