Proximal Point Algorithms for Vector DC Programming with Applications to Probabilistic Lot Sizing with Service Levels

Ying Ji and Shaojian Qu

Discrete Dynamics in Nature and Society, 2017, vol. 2017, 1-8

Abstract:

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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2017/5675183.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2017/5675183.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:5675183

DOI: 10.1155/2017/5675183

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().