关键词: 非线性规划, 罚函数法, 几何规划, 内点法, 序列二次规划法

Abstract:

This article describes the mathematical model of nonlinear programming,namely what with inequality constraints of the optimal solution for a class of objective functions for solving optimization problems.The most widely used method for solving nonlinear programming problems today is introduced,that is penalty interior point method algorithm.Interior-point method of path tracking and sequential quadratic programming method are presented for solving geometric programming problems.A comparison is made between the results of Interior-point method of path tracking and sequential quadratic programming method using examples.The results show that the sequential quadratic programming method is superior to the other two methods both in number of iterations and in the running final optimization solution.

Key words: nonlinear programming;penalty function method;geometric programming;interior-point method;SQP