{"title":"非光滑广义凸多目标规划的最优性条件及鞍点理论","authors":"Cailing Wang, Wenjuan Sun, You Zhang, Zhongfan Li","doi":"10.1109/CCDC.2009.5191826","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution.","PeriodicalId":127110,"journal":{"name":"2009 Chinese Control and Decision Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimality conditions and saddle-point theory for nonsmooth generalized convexity multiobjective programming\",\"authors\":\"Cailing Wang, Wenjuan Sun, You Zhang, Zhongfan Li\",\"doi\":\"10.1109/CCDC.2009.5191826\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution.\",\"PeriodicalId\":127110,\"journal\":{\"name\":\"2009 Chinese Control and Decision Conference\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Chinese Control and Decision Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2009.5191826\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Chinese Control and Decision Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2009.5191826","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimality conditions and saddle-point theory for nonsmooth generalized convexity multiobjective programming
In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution.