| Nonlinear programming constrained conditions have a wide range of applicationsin financial and economic control and biological engineering, technical physics,computer science, engineering, and many other fields. In many of the projects in thepractical applications,many problem can be written in non-linear programmingoptimization of complex problems of mathematical model for solving. The geometricplanning as a non-linear planning a kind of special branch, applications are also veryextensive. To solve large-scale constraint optimization problem, geometricprogramming algorithm has a very big advantage.This article starts with the nonlinear programming, describes the mathematicalmodel of nonlinear programming: with inequality constraints of the optimal solutionfor a class of objective functions for solving optimization problems, and introducedtoday for solving nonlinear programming problems, the use of the most widely usedpenalty function algorithm, as well as punishes the function algorithm two branches:Penalty function method of penalty function outside point and Interior point method.As a key, make the detailed introduction on Interior point method.And points out theexample confirmation algorithm the feasibility.Geometric programming is a special class of nonlinear programming, specially invery many engineering design, Abstract from the mathematical models are geometricprogramming, therefore, geometric programming has also been widely used in all areasof social sciences and natural sciences. This article details the General form ofgeometric programming,and the theoretical basis for many of the algorithms forsolving geometric programming: The duality theory. Second highlights two algorithmfor solving geometric programming problem: Interior-point method of path trackingand sequential quadratic programming method.Finally, by way of example, Compares the results of Interior-point method of pathtracking and sequential quadratic programming method, Finally gives the conclusion. |
PDF Full Text Request