CAJ | 학술논문

为了简化非线性规划问题求最优解的计算量，在 KKT-不变凸（Karush-Kuhn-Tucker-invex）优化问题以及G-不变凸函数概念的基础上，引入了G-KKT-不变凸问题的概念。在G-型约束限制的条件下，证明了非线性规划问题（NP）的每个G-KKT 点是全局最小值点的充分必要条件。通过算例表明该充分必要条件在多数情况下可以大大简化求最优解的计算量。
위료간화비선성규화문제구최우해적계산량，재 KKT-불변철（Karush-Kuhn-Tucker-invex）우화문제이급G-불변철함수개념적기출상，인입료G-KKT-불변철문제적개념。재G-형약속한제적조건하，증명료비선성규화문제（NP）적매개G-KKT 점시전국최소치점적충분필요조건。통과산례표명해충분필요조건재다수정황하가이대대간화구최우해적계산량。
In order to simplify the calculation of the optimal solution to the Nonlinear programming problem (NP) ,the concept of G-KKT-invex was introduced based on the problem of KKT-invex nonlinear programming and the concept of G-invex function .Under the assumption of G-type constraint qualification ,it was proved that each G-KKT point of the Nonlinear programming problem (NP) is the sufficient and necessary condition for the global minimum point .The calculation example shows that the sufficient and necessary condition can greatly simplify the calculation of optimal solution in most cases .