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

Discrete Applied Mathematics

Volumn 156, Issue 3, 2008, Pages 325-338

  Le Thi, Hoai An ^a   Pham Dinh, Tao ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Concave cost supply problem; Concave programming; DC (Difference of Convex functions) programming; DCA; Disjunctive constraints; Exact penalty; Mixed 0 1 concave programming; Reformulation

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COST ACCOUNTING; FUNCTIONS; PROBLEM SOLVING;

CONCAVE COST SUPPLY PROBLEMS; CONCAVE PROGRAMMING; CONVEX FUNCTIONS; DISJUNCTIVE CONSTRAINTS; EXACT PENALTY; MIXED 0-1 CONCAVE PROGRAMMING; REFORMULATION;

LINEAR PROGRAMMING;

EID: 38049053083     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.03.024     Document Type: Article

References (14)

1. Chauhan S.S., Eremeev A.V., Kolokolov A.A., and Servakh V.V. Concave cost supply management problem for single manufacturing unit. In: Dolgui A., Soldek J., and Zaikin O. (Eds). Supply Chain Optimisation (2004), Kluwer Academic Publishers 167-174
2. Chauhan S.S., and Proth J.M. The concave cost supply problem. European J. Oper. Res. 148 (2003) 374-383
3. Larsson T., Migdalas A., and Ronnqvist M. A Lagrangian heuristic for the capacited concave minimum cost network flow problem. European J. Oper. Res. 78 (1994) 116-129
4. H.A. Le Thi, Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algorithmes et Applications, Habilitation à Diriger des Recherches, Université de Rouen, 1997.
5. Le Thi H.A., and Pham Dinh T. Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optim. 11 (1997) 253-285
6. Le Thi H.A., and Pham Dinh T. A continuous approach for large-scale linearly constrained quadratic zero-one programming. Optimization 50 1,2 (2001) 93-120
7. Le Thi H.A., and Pham Dinh T. Large scale molecular optimization from exact distance matrices by a DC optimization approach. SIAM J. Optim. 14 1 (2003) 77-116
8. Le Thi H.A., and Pham Dinh T. The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133 (2005) 23-46
9. Le Thi H.A., Pham Dinh T., and Muu L.D. Exact penalty in DC programming. Vietnam J. Math. 27 2 (1999) 169-178
10. Pham Dinh T., and Le Thi H.A. Convex analysis approach to DC programming: theory algorithms and applications (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday). Acta Math. Vietnam. 22 (1997) 289-355
11. Pham Dinh T., and Le Thi H.A. D.c. optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8 (1998) 476-505
12. Schüle T., Schnörr C., Weber S., and Hornegger J. Discrete tomography by convex-concave regularization and d.c. programming. Discrete Appl. Math. 151 (2005) 229-243
13. S. Weber, T. Schüle, J. Hornegger, C. Schnörr, Binary tomography by iterating linear programs from noisy projections, in: Proceedings of International Workshop on Combinatorial Image Analysis (IWCIA), Auckland, New Zealand, December 1.-3./2004, Lecture Notes in Computer Science, Springer, Berlin, 2004.
14. Yan S., and Luo S.C. Probabilistic local search algorithms for concave cost transportation network problems. European J. Oper. Res. 117 (1999) 511-521