A continuous approach for the concave cost supply problem via DC programming and DCA

作     者：Le Thi, Hoai An Dinh, Tao Pham 

作者机构：Univ Metz Lab Theoret & Appl Comp Sci UFR MIM F-57045 Metz France Natl Inst Appl Sci Lab Modelling Optimizat & Operat Res F-76131 Mont St Aignan France 

出 版 物：《DISCRETE APPLIED MATHEMATICS》 (离散应用数学)

年 卷 期：2008年第156卷第3期

页      面：325-338页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：reformulation concave cost supply problem disjunctive constraints mixed 0-1 concave programming exact penalty concave programming DC (Difference of convex functions) programming DCA 

摘      要：The paper addresses an important but difficult class of concave cost supply management problems which consist in minimizing a separable increasing concave objective function subject to linear and disjunctive constraints. We first recast these problems into mixed zero-one nondifferentiable concave minimization over linear constraints problems and then apply exact penalty techniques to state equivalent nondifferentiable polyhedral DC (Difference of Convex functions) programs. A new deterministic approach based on DC programming and DCA (DC Algorithms) is investigated to solve the latter ones. Finally numerical simulations are reported which show the efficiency, the robustness and the globality of our approach. (c) 2007 Elsevier B.V. All fights reserved.