文中引入了一类广义不变凸函数，对一类变分问题给出了最优解的充分性条件以及对偶理论。
The generalized invex functions are introduced and the optimality theorems and duality theory are established for a class of variational problems.
此公式具有渐进强对偶的特性并且可以保证找到原问题的最优解。
This formulation possesses an asymptotic strong duality property and guarantees a success for identifying an optimum solution.
文中着重介绍了当对偶规划问题数学模型出现重复方程时，可通过重构原规划问题的方法，求得问题的最优解。
Emphasis is given to that when repeated equations appear in the mathematical model of the duality programming problem, global optimized solution can be obtained by reconstructing the original program.
应用推荐