×

zbMATH — the first resource for mathematics

Solving a class of geometric programming problems by an efficient dynamic model. (English) Zbl 1311.90143
Summary: In this paper, a neural network model is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalle invariance principle to solve geometric programming (GP) problems. The main idea is to convert the GP problem into an equivalent convex optimization problem. A neural network model is then constructed for solving the obtained convex programming problem. By employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the original problem. The simulation results also show that the proposed neural network is feasible and efficient.

MSC:
90C30 Nonlinear programming
PDF BibTeX XML Cite
Full Text: DOI Link