文章基本信息

标题：Proximal Point Algorithms for Vector DC Programming with Applications to Probabilistic Lot Sizing with Service Levels
本地全文：下载
作者：Ying Ji ; Shaojian Qu
期刊名称：Discrete Dynamics in Nature and Society
印刷版ISSN：1026-0226
电子版ISSN：1607-887X
出版年度：2017
卷号：2017
DOI：10.1155/2017/5675183
出版社：Hindawi Publishing Corporation
摘要：We present a new algorithm for solving vector DC programming, where the vector function is a function of the difference of C-convex functions. Because of the nonconvexity of the objective function, it is difficult to solve this class of problems. We propose several proximal point algorithms to address this class of problems, which make use of the special structure of the problems (i.e., the DC structure). The well-posedness and the global convergence of the proposed algorithms are developed. The efficiency of the proposed algorithm is shown by an application to a multicriteria model stemming from lot sizing problems.