摘要: 利用Bector定义的广义凸函数———univex函数 ,讨论可微广义凸规划和可微多目标广义凸规划的Kuhn Tucker最优充要条件.
中图分类号:
孙清滢, 叶留青 . 可微广义凸规划的最优充要条件[J]. 数学季刊, 2000, 15(4): 33-37.
SUN Qing-ying, YE Liu-qing. Necessary and Sufficient Conditions in Smooth Programming with Generalized Convexity [J]. Chinese Quarterly Journal of Mathematics, 2000, 15(4): 33-37.